yusuke1997/dblp-id-title huggingface dataset:
Zeno, Hercules, and the Hydra: Safety Metric Temporal Logic is Ackermann-Complete
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics
Generalized Eilenberg Theorem: Varieties of Languages in a Category
First-Order Temporal Logic on Finite Traces: Semantic Properties, Decidable Fragments, and Applications
Model checking stochastic automata
Optimizing optimal reduction: A type inference algorithm for elementary affine logic
Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution
The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic
Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect Knowledge Transfer)
Annotated Probabilistic Temporal Logic: Approximate Fixpoint Implementation
Clausal temporal resolution
Outlier detection by logic programming
Fast verification of MLL proof nets via IMLL
Probabilistic bisimulation as a congruence
A decomposition-based implementation of search strategies
Kripke Semantics for Intersection Formulas
Reasoning about actions with sensing under qualitative and probabilistic uncertainty
The arithmetical complexity of dimension and randomness
Model-checking continous-time Markov chains
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games
Parametrised Complexity of Satisfiability in Temporal Logic
Reachability Problems in Piecewise FIFO Systems
Boolean satisfiability with transitivity constraints
A comprehensive combination framework
Belief Merging within Fragments of Propositional Logic
A Hoare Logic for GPU Kernels
Sequential abstract-state machines capture sequential algorithms
The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes
1-in-3 vs. Not-All-Equal: Dichotomy of a Broken Promise
Sequent and hypersequent calculi for abelian and Łukasiewicz logics
Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting
A complete characterization of complete intersection-type preorders
MSO definable string transductions and two-way finite-state transducers
Topological incompleteness and order incompleteness of the lambda calculu
A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals
Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
Inferring non-suspension conditions for logic programs with dynamic scheduling
New results on rewrite-based satisfiability procedures
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics
A concrete framework for environment machines
Characterisation of Normalisation Properties for λμ using Strict Negated Intersection Types
A note on the complexity of propositional Hoare logic
An Operational Semantics for the Cognitive Architecture ACT-R and Its Translation to Constraint Handling Rules
Centralized vs. Decentralized Monitors for Hyperproperties
O-Minimal Invariants for Discrete-Time Dynamical Systems
How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculi
Interval constraint solving for camera control and motion planning
Alternating automata on data trees and XPath satisfiability
Parametric temporal logic for "model measuring"
Symbolic semantic rules for producing compact STGLAs from value passing process descriptions
Pure pointer programs with iteration
Model-Checking on Ordered Structures
α β-Relations and the Actual Meaning of α-Renaming
Graded computation tree logic
Complexity results on DPLL and resolution
Termination of simply moded logic programs with dynamic scheduling
Fixed-point Elimination in the Intuitionistic Propositional Calculus
Probabilistic Temporal Reasoning Using Superposition Semantics
A Formal System for the Universal Quantification of Schematic Variables
On Composing Finite Forests with Modal Logics
PSPACE bounds for rank-1 modal logics
Logics for Temporal Information Systems in Rough Set Theory
On the Verification of Livelock-Freedom and Self-Stabilization on Parameterized Rings
The NP Search Problems of Frege and Extended Frege Proofs
An elementary fragment of second-order lambda calculus
Ordinary interactive small-step algorithms, I
Erratum for "Randomization in Automata on Infinite Trees"
Automated Deduction in Gödel Logic
Permissive-nominal logic: First-order logic over nominal terms and sets
Deciding the confluence of ordered term rewrite systems
Probabilistic Event Calculus for Event Recognition
A Generalized QSQR Evaluation Method for Horn Knowledge Bases
Proof nets for unit-free multiplicative-additive linear logic
Linear Logic Properly Displayed
Possibilistic Justification Logic: Reasoning About Justified Uncertain Beliefs
Three syntactic theories for combinatory graph reduction
On the Power of Substitution in the Calculus of Structures
FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols
Incremental Linearization for Satisfiability and Verification Modulo Nonlinear Arithmetic and Transcendental Functions
Algebra-coalgebra duality in Brzozowski's minimization algorithm
Spectrum of FO Logic with Quantifier Depth 4 is Finite
A formally verified proof of the prime number theorem
Where fail-safe default logics fail
Principles of KLM-style Defeasible Description Logics
Persistent queries in the behavioral theory of algorithms
First-Order Logic on Higher-Order Nested Pushdown Trees
Reasoning with recursive loops under the PLP framework
Complexities of Horn Description Logics
The Complexity of Positive First-Order Logic without Equality
Proofs, tests and continuation passing style
Inputs and Outputs in CSP: A Model and a Testing Theory
Completeness of Flat Coalgebraic Fixpoint Logics
A system of interaction and structure
A decision procedure for term algebras with queues
A Modular Type Reconstruction Algorithm
Efficient generation of craig interpolants in satisfiability modulo theories
Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering?
Complexity of propositional nested circumscription and nested abnormality theories
Unicast and multicast QoS routing with soft-constraint logic programming
Complexity of conservative constraint satisfaction problems
Taming Paraconsistent (and Other) Logics: An Algorithmic Approach
An algebra of quantum processes
De Morgan Dual Nominal Quantifiers Modelling Private Names in Non-Commutative Logic
Propositional Update Operators Based on Formula/Literal Dependence
Circular (Yet Sound) Proofs in Propositional Logic
Higher-order term indexing using substitution trees
Typed Nominal Rewriting
Model-checking Strategic Abilities in Information-sharing Systems
Monodic temporal resolution
Model Checking Existential Logic on Partially Ordered Sets
Non-well-founded Proof Theory of Transitive Closure Logic
Uniqueness of Normal Forms for Shallow Term Rewrite Systems
Characterising Modal Formulas with Examples
Hierarchies in Dependence Logic
Decidability of Approximate Skolem Problem and Applications to Logical Verification of Dynamical Properties of Markov Chains
On the Expressive Power of Multiple Heads in CHR
Computational properties of metaquerying problems
Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic
Constraint Propagation for First-Order Logic and Inductive Definitions
Eliminating definitions and Skolem functions in first-order logic
Asynchronous Announcements
Reasoning about Petri Nets: A Calculus Based on Resolution and Dynamic Logic
A modal logic framework for multi-agent belief fusion
A proof theory for generic judgments
Inference from Visible Information and Background Knowledge
LICS 2001 special issue
Quantitative Aspects of Linear and Affine Closed Lambda Terms
Knowledge in multiagent systems: initial configurations and broadcast
Modularisation of Sequent Calculi for Normal and Non-normal Modalities
Super-Solutions: Succinctly Representing Solutions in Abductive Annotated Probabilistic Temporal Logic
Guest editorial: Special issue on implicit computational complexity
On equivalence and canonical forms in the LF type theory
Reasoning about evolving nonmonotonic knowledge bases
Making abstract domains condensing
Using tableau to decide description logics with full role negation and identity
The Probability of a Computable Output from a Random Oracle
Model Checking of Recursive Probabilistic Systems
A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
Open answer set programming with guarded programs
Interpolation in Linear Logic and Related Systems
Alternating timed automata
An Epistemic Strategy Logic
Hypothetical Answers to Continuous Queries Over Data Streams
Invariant Checking for SMT-Based Systems with Quantifiers
A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types
Knuth-Bendix constraint solving is NP-complete
Finite Open-world Query Answering with Number Restrictions
Products, Polynomials and Differential Equations in the Stream Calculus
Pebble Weighted Automata and Weighted Logics
On Proof Complexity of Resolution over Polynomial Calculus
Łukasiewicz Games: A Logic-Based Approach to Quantitative Strategic Interactions
Abstract Program Slicing: An Abstract Interpretation-Based Approach to Program Slicing
Recycling computed answers in rewrite systems for abduction
Symbolic Bisimulation for Quantum Processes
CSL 2008 special issue
LTL with the freeze quantifier and register automata
Incremental execution of guarded theories
Rational Region-Based Affine Logic of the Real Plane
An inclusion theorem for defeasible logics
Computationally Hard Problems for Logic Programs under Answer Set Semantics
Universal Equivalence and Majority of Probabilistic Programs over Finite Fields
Logic programming revisited: Logic programs as inductive definitions
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
Heterogeneous temporal probabilistic agents
Beyond Uniform Equivalence between Answer-set Programs
Reasoning with higher-order abstract syntax in a logical framework
Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants
Belief Merging by Examples
Specifying norm-governed computational societies
A PSPACE-complete first-order fragment of computability logic
Geometry of Interaction for MALL via Hughes-Van Glabbeek Proof-Nets
Modal abstractions of concurrent behavior
Proof-complexity results for nonmonotonic reasoning
Super logic programs
Maps in Multiple Belief Change
Removing propagation redundant constraints in redundant modeling
First-order queries on structures of bounded degree are computable with constant delay
Extending two-variable logic on data trees with order on data values and its automata
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator
Normal Higher-Order Termination
The axiomatic translation principle for modal logic
Reasoning about Strategic Abilities: Agents with Truly Perfect Recall
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation
Structural Focalization
From linear time to branching time
Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic
Partial-Observation Stochastic Games: How to Win when Belief Fails
Back and forth between guarded and modal logics
On the distributivity of LTL specifications
An effective decision procedure for linear arithmetic over the integers and reals
On the Decidability of Elementary Modal Logics
Hypersequent Calculi for Propositional Default Logics
Basic theory of feature trees
Analytic tableaux calculi for KLM logics of nonmonotonic reasoning
Induction from answer sets in nonmonotonic logic programs
Tableau-based decision procedures for logics of strategic ability in multiagent systems
Domain-dependent knowledge in answer set planning
Proof Nets for Herbrand's Theorem
MTL and TPTL for One-Counter Machines: Expressiveness, Model Checking, and Satisfiability
Complexity of Data Dependence Problems for Program Schemas with Concurrency
Simulation-based minimazation
Complete Abstractions for Checking Language Inclusion
Splitting an operator: Algebraic modularity results for logics with fixpoint semantics
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces
Checking timed Büchi automata emptiness on simulation graphs
Ordinary interactive small-step algorithms, III
Complexity of Propositional Logics in Team Semantic
Classes of term rewrite systems with polynomial confluence problems
Termination proofs for logic programs with tabling
Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
MWeb: A principled framework for modular web rule bases and its semantics
Erratum for "What causes a system to satisfy a specification?"
Central Limit Model Checking
Finitary winning in omega-regular games
Well-structured program equivalence is highly undecidable
Abstract computability and algebraic specification
Parallel Abductive Query Answering in Probabilistic Logic Programs
Intuitionistic Linear Temporal Logics
A logical characterization of the counting hierarchy
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
A calculus of multiary sequent terms
Efficiently Deciding μ-Calculus with Converse over Finite Trees
Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus
Structural Analysis of Boolean Equation Systems
A finite equational base for CCS with left merge and communication merge
Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction
Index Problems for Game Automata
Verifying security protocols as planning in logic programming
On the Complexity of Model Checking Knowledge and Time
Intuitionistic Light Affine Logic
Modalities and Parametric Adjoints
Optimal Tableau Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-Time Temporal Logic ATL +
First-order conditional logic for default reasoning revisited
Abstract state machines capture parallel algorithms: Correction and extension
Comparisons and computation of well-founded semantics for disjunctive logic programs
The Intersection of Algorithmically Random Closed Sets and Effective Dimension
Optimization Modulo Theories with Linear Rational Costs
The DLV system for knowledge representation and reasoning
Strategy Logic with Imperfect Information
On unification for bounded distributive lattices
A computational theory of normative positions
Fuzzy Time in Linear Temporal Logic
Nonelementary Complexities for Branching VASS, MELL, and Extensions
Logics for information systems and their dynamic extensions
Probabilistic interval XML
Datalog programs and their persistency numbers
An extended transformation approach to inductive logic programming
Limiting Until in Ordered Tree Query Languages
A Model-Theoretic Approach to Belief Change in Answer Set Programming
An Automatic Proving Approach to Parameterized Verification
Randomization in Automata on Infinite Trees
The Reachable Simulation Problem
Probabilistic logic programming with conditional constraints
A Representation Theorem for Change through Composition of Activities
Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework
Computing persistent homology within Coq/SSReflect
Action Logic is Undecidable
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies
Foundational certified code in the Twelf metalogical framework
Reasoning About Strategies: On the Model-Checking Problem
Higher Homotopies in a Hierarchy of Univalent Universes
Dynamic Reasoning Systems
Expressiveness of Logic Programs under the General Stable Model Semantics
Arithmetic, first-order logic, and counting quantifiers
Logical characterizations of heap abstractions
Generalizing Parikh's Criterion for Relevance-Sensitive Belief Revision
AGM Belief Revision, Semantically
A Certified Reduction Strategy for Homological Image Processing
Tableau Calculi for Logic Programs under Answer Set Semantics
Well-founded semantics for description logic programs in the semantic web
Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers
On Well-Founded Set-Inductions and Locally Monotone Operators
Ordinary interactive small-step algorithms, II
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
Intuitionistic Gödel-Löb without Sharps
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems
A theory of normed simulations
Inadequacy of computable loop invariants
Quantified Constraint Satisfaction Problem on Semicomplete Digraphs
Typechecking XML views of relational databases
Extending Liquid Types to Arrays
Annotated probabilistic temporal logic
Compilability of propositional abduction
An Axiomatic Theory for Reversible Computation
Path Categories and Propositional Identity Types
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
Polynomial-time computation via local inference relations
Convergence law for random graphs with specified degree sequence
Local Belief Dynamics in Network Knowledge Bases
Good-for-Game QPTL: An Alternating Hodges Semantics
Precise Subtyping for Asynchronous Multiparty Sessions
A sequent calculus and a theorem prover for standard conditional logics
Description logics of minimal knowledge and negation as failure
The intuitionism behind Statecharts steps
Polymorphic type inference for the named nested relational calculus
On isomorphisms of intersection types
A General Theory of Barbs, Contexts, and Labels
Proof search specifications of bisimulation and modal logics for the pi-calculus
Topological Logics with Connectedness over Euclidean Spaces
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic
On knowledge-based programming with sensing in the situation calculus
Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism
Fuzzy Equilibrium Logic: Declarative Problem Solving in Continuous Domains
Efficient solving of quantified inequality constraints over the real numbers
Degree lower bounds of tower-type for approximating formulas with parity quantifiers
From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics
On the Logical and Algebraic Aspects of Reasoning with Formal Contexts
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability
Pure Sequent Calculi: Analyticity and Decision Procedure
One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries
A Confluent Rewriting System Having No Computable, One-Step, Normalizing Strategy
Soft concurrent constraint programming
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation
Quantitative languages
Simplification Rules for Intuitionistic Propositional Tableaux
Horn Fragments of the Halpern-Shoham Interval Temporal Logic
Compilability and compact representations of revision of Horn knowledge bases
Preferred First-Order Answer Set Programs
A Complete Finite Axiomatisation of the Equational Theory of Common Meadows
Mixed Iterated Revisions: Rationale, Algorithms, and Complexity
On the Variable Hierarchy of First-Order Spectra
Deciding strategy properties of contract-signing protocols
Hypothesis-based semantics of logic programs in multivalued logics
Verification of Distributed Quantum Programs
Fair Synthesis for Asynchronous Distributed Systems
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas
Decidability of Downward XPath
Typed interpretations of extensible objects
Termination of rewriting under strategies
Constraint satisfaction tractability from semi-lattice operations on infinite sets
Closing Star-Free Closure
A Higher-Order Calculus of Computational Fields
The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates
Primal Logic of Information
Extensible Proof Systems for Infinite-State Systems
SIGMOD Chair's Message
Foreword to Volume 1
Foreword to the Silver Edition
Multics Relational Data Store (MRDS)
Business System 12
The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings
The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98
TSQL2 Temporal Query Language / TSQL2 and SQL3 Interactions
G-EXEC geological data handling system
Shuffle-Based Multilanguages
Generalized P-Systems with Splicing and Cutting/Recombination
Introduction to the Special Issue on Grammar Induction
Relaxing Underspecified Semantic Representations for Reinterpretation
The Automatic Deduction of Classificatory Systems from Linguistic Theories
Eventualities in Time: The localization of eventualities in the Platonist and the Reductionist picture of time
The Power of Catalysts and Priorities in Membrane Systems
Grammar Induction: An Invitation to Formal Language Theorists
Interactive Graph Grammar
Lexical Object Theory: Specification Level
Run-time Extensible Deterministic Top-Down Parsing
Why Grammar Systems?
Regulated Grammars under Leftmost Derivation
A Note on Hybrid P Systems
Using Linear Positional Grammars for the LR Parsing of 2-D Symbolic Languages
Computational Grammar Induction for Linguists
Quantitative Comparison of Languages
Grammar Efficiency and Complexity
Black Box and White Box Identification of Formal Languages Using Test Sets
Structural Properties of Shuffle Automata
Modeling Chaotic Series by Simple Eco-Grammar Systems with Reproduction, Death and Maturation of Agents
Derived Trees Evolution for Tree Adjoining Grammars Parsing
Proof-Nets, Hybrid Logics and Minimalist Representations
On Special Forms of Restarting Automata
The Polarity Parameter for Ellipsis Coherence
A Cubic Time Extension of Context-Free Grammars
Conditional Tabled Eco-Grammar Systems: the Scattered Contexts
Modular Context-Free Grammars
On the Power of Reading the Whole Infinite Input Tape
Cut-and-Paste Languages
An Approach to Syllables via some Extensions of Marcus Contextual Grammars
Top-Down Parsing of Conjunctive Languages
Computational Complexity of Probabilistic Disambiguation
A Note on the Equivalence and Complexity of Linear Grammars
On Hybrid Eco-rewriting Systems
Parallel Grammars: A Phenomenology
Languages of Partial Words - How to Obtain Them and What Properties They Have
Multiple Pattern Interpretations
Tabulation for Multi-Purpose Partial Parsing
Peirce Grammar
Formalizing Mirror Theory
An HPSG-Analysis for Free Relative Clauses in German
Context-Sensitive Node Admissibility
Constraints on Derivations
Languages Generated Using an Abstract Catenation
On the Generative Capacity of Bracketed Contextual Grammars
Descriptions of Cross-Serial Dependencies
e-GRIDS: Computationally Efficient Gramatical Inference from Positive Examples
Combining Contextual Grammars and Tree Adjoining Grammars
Polarizationless P Systems with Active Membranes
Statistical Distribution and the Grammatical/Ungrammatical Distinction
LR Parsing for Conjunctive Grammars
Towards Biolinguistics
Parallel Communicating Grammar Systems As Language Analyzers
The Algebraic Semantics of Interrogative NPs
Determinism in Eco-Grammar Systems
Greatest Model Semantics for Typed Feature Structures
Context-Free Recognition with Weighted Automata
Type Grammars as Pregroups
A Descriptive Characterisation of Even Linear Languages
Tabulation of Automata for Tree-Adjoining Languages
P Systems with Symport/Antiport Rules: The Traces of Objects
On Psycholinguistic Grammars
On the Hierarchy of Extended Conditional Tabled Eco-Grammar Systems
Stochastically-Based Semantic Analysis for ARISE - Automatic Railway Information Systems for Europe
Uniquely Parsable Unification Grammars and Their Parser Implemented in Prolog
Patterns and Languages: An Overview
On the Semantics of Unification Grammars
On the Concatenation of One-Turn Pushdowns
Non-Commutative Linear Logic in Linguistics
Learning k-Testable and k-Piecewise Testable Languages from Positive Data
Chomsky-Schutzenberger Type Characterizations Based on Contextual Languages
Local Tree Description Grammars
Gap Parsing with LL(1) Grammars
Finite State Transducers with Predicates and Identities