Guarded Negation
From MaRDI portal
Publication:5890544
DOI10.1145/2701414zbMath1333.68133MaRDI QIDQ5890544
Luc Segoufin, Balder ten Cate, Vince Bárány
Publication date: 24 March 2016
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2701414
68Q25: Analysis of algorithms and problem complexity
03B45: Modal logic (including the logic of norms)
03B70: Logic in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
SOME MODEL THEORY OF GUARDED NEGATION, Unnamed Item, Unnamed Item, Unnamed Item, Guarded Ontology-Mediated Queries, Semiring Provenance for Guarded Logics, On Monotonic Determinacy and Rewritability for Recursive Queries and Views, Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments, Statistical \(\mathcal{EL}\) is \textsc{ExpTime}-complete, Logical separability of labeled data examples under ontologies, Evaluating Datalog via tree automata and cycluits, Propositional epistemic logics with quantification over agents of knowledge (an alternative approach), Querying the Unary Negation Fragment with Regular Path Expressions.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite satisfiability for guarded fixpoint logic
- Expressive completeness through logically tractable models
- Modal languages and bounded fragments of predicate logic
- Undecidability results on two-variable logics
- On the complexity of single-rule datalog queries.
- Loosely guarded fragment of first-order logic has the finite model property
- The finite graph problem for two-way alternating automata.
- Modal and guarded characterisation theorems over finite transition systems
- Unary negation
- Rewriting Guarded Negation Queries
- Games and Model Checking for Guarded Logics
- Query evaluation via tree-decompositions
- On languages with two variables
- Fixed Point Logics
- On the Restraining Power of Guards
- Querying the Guarded Fragment
- Guarded Negation
