Guarded negation
From MaRDI portal
Publication:5890544
DOI10.1145/2701414zbMATH Open1333.68133OpenAlexW2341631904MaRDI QIDQ5890544FDOQ5890544
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
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modal languages and bounded fragments of predicate logic
- Query evaluation via tree-decompositions
- Querying the Guarded Fragment
- On the complexity of single-rule datalog queries.
- On languages with two variables
- Undecidability results on two-variable logics
- Finite satisfiability for guarded fixpoint logic
- On the Restraining Power of Guards
- Rewriting Guarded Negation Queries
- Guarded Negation
- Expressive completeness through logically tractable models
- Fixed Point Logics
- Modal and guarded characterisation theorems over finite transition systems
- Loosely guarded fragment of first-order logic has the finite model property
- Games and Model Checking for Guarded Logics
- The finite graph problem for two-way alternating automata.
- Unary negation
Cited In (15)
- Propositional epistemic logics with quantification over agents of knowledge (an alternative approach)
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)
- Title not available (Why is that?)
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments
- Title not available (Why is that?)
- Statistical \(\mathcal{EL}\) is \textsc{ExpTime}-complete
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views
- SOME MODEL THEORY OF GUARDED NEGATION
- Craig interpolation for decidable first-order fragments
- Semiring Provenance for Guarded Logics
- Guarded Ontology-Mediated Queries
- Querying the Unary Negation Fragment with Regular Path Expressions.
- Title not available (Why is that?)
- Evaluating Datalog via tree automata and cycluits
- Logical separability of labeled data examples under ontologies
This page was built for publication: Guarded negation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5890544)
