Computer Science Logic

DOI10.1007/11538363MaRDI QIDQ5394585zbMATH OpenOpenAlexFDO

Authors Emanuel Kieroński

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11538363

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards
• On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
• Decidability of the Guarded Fragment with the Transitive Closure
• Finite satisfiability of the two-variable guarded fragment with transitive guards and related variants
• On the complexity of the two-variable guarded fragment with transitive guards
• Querying the guarded fragment with transitivity
• Automated Reasoning
• The guarded fragment with transitive guards
• Equivalence closure in the two-variable guarded fragment
• scientific article; zbMATH DE number 2086420

Cited in

(28)

• Propositional epistemic logics with quantification over agents of knowledge
• The fluted fragment with transitive relations
• Guards, bounds, and generalized semantics
• Guarded fragments with constants
• Small substructures and decidability issues for first-order logic with two variables
• Equivalence closure in the two-variable guarded fragment
• On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards
• Decidability of the Guarded Fragment with the Transitive Closure
• scientific article; zbMATH DE number 1956520 (Why is no real title available?)
• Finite satisfiability of the two-variable guarded fragment with transitive guards and related variants
• scientific article; zbMATH DE number 2086420 (Why is no real title available?)
• One-dimensional guarded fragments
• Finite satisfiability of unary negation fragment with transitivity
• Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable
• Complexity of two-variable logic on finite trees
• On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
• Logics in Artificial Intelligence
• Epistemic logics with quantification over epistemic operators: decidability and expressiveness
• On the existential fragments of local first-order logics with data
• On the satisfiability of local first-order logics with data
• Craig interpolation for decidable first-order fragments
• On two-variable first-order logic with a partial order
• The adjacent fragment and Quine's limits of decision
• Craig interpolation for decidable first-order fragments
• Alternating quantifiers in uniform one-dimensional fragments with an excursion into three-variable logic
• The triguarded fragment with transitivity
• An excursion to the border of decidability: between two- and three-variable logic
• On the complexity of the two-variable guarded fragment with transitive guards

This page was built for publication: Computer Science Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5394585)