Guarded negation
From MaRDI portal
Recommendations
Cites work
- Expressive completeness through logically tractable models
- Finite satisfiability for guarded fixpoint logic
- Fixed Point Logics
- Games and model checking for guarded logics
- Guarded negation
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 1303729 (Why is no real title available?)
- scientific article; zbMATH DE number 1860675 (Why is no real title available?)
- Loosely guarded fragment of first-order logic has the finite model property
- Modal and guarded characterisation theorems over finite transition systems
- Modal languages and bounded fragments of predicate logic
- On languages with two variables
- On the complexity of single-rule datalog queries.
- On the Restraining Power of Guards
- Query evaluation via tree-decompositions
- Querying the Guarded Fragment
- Rewriting Guarded Negation Queries
- The finite graph problem for two-way alternating automata.
- Unary negation
- Undecidability results on two-variable logics
Cited in
(33)- Guarded fixed point logics and the monadic theory of countable trees.
- 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)
- Guards, bounds, and generalized semantics
- Unary negation
- Unary negation
- Querying the unary negation fragment with regular path expressions
- scientific article; zbMATH DE number 1989656 (Why is no real title available?)
- The complexity of boundedness for guarded logics
- SOME MODEL THEORY OF GUARDED NEGATION
- On the Restraining Power of Guards
- Guarded Ontology-Mediated Queries
- Semiring Provenance for Guarded Logics
- One-dimensional guarded fragments
- Finite satisfiability of unary negation fragment with transitivity
- When can we answer queries using result-bounded data interfaces?
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views
- Guarded negation
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)
- Craig interpolation for decidable first-order fragments
- On polynomial-time decidability of k-negations fragments of first-order theories
- Proof systems for two-way modal -calculus
- The adjacent fragment and Quine's limits of decision
- Craig interpolation for decidable first-order fragments
- A uniform one-dimensional fragment with alternation of quantifiers
- Monodic fragments of probabilistic first-order temporal logic with bounded semantics
- Decidability of querying first-order theories via countermodels of finite width
- Alternating quantifiers in uniform one-dimensional fragments with an excursion into three-variable logic
- Beyond symbolic heaps: deciding separation logic with inductive definitions
- Fluted logic with counting
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)
