The Complexity of Circumscriptive Inference in Post’s Lattice

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Theory of Computing Systems

• Publication date

  2012-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00224-010-9311-6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Trichotomies in the Complexity of Minimal Inference

  2012cited by this paper
• The Complexity of Model Checking for Boolean Formulas

  2010cited by this paper
• The Complexity of Circumscriptive Inference in Post’s Lattice

  2009cited by this paper
• The Complexity of Satisfiability for Fragments of CTL and CTL*

  2008cited by this paper
• The complexity of propositional implication

  2008influential reference
• The complexity of reasoning for fragments of default logic

  2008cited by this paper
• The Complexity of Generalized Satisfiability for Linear Temporal Logic

  2007influential reference
• Generalized modal satisfiability

  2006cited by this paper
• The Complexity of Problems Defined by Boolean Circuits

  2005cited by this paper
• I Computational Complexity

  2005cited by this paper
• SIGACT news complexity theory column 48

  2005cited by this paper
• A Trichotomy in the Complexity of Propositional Circumscription

  2005influential reference
• The Complexity of the Boolean Formula Value Problem

  2005cited by this paper
• The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete

  2003cited by this paper
• On the Complexity of Some Equivalence Problems for Propositional Calculi

  2003cited by this paper
• The complexity of minimal satisfiability problems

  2001cited by this paper
• A Dichotomy in the Complexity of Propositional Circumscription

  2001cited by this paper
• Introduction to Circuit Complexity

  1999cited by this paper
• Theories of computability

  1997cited by this paper
• Circumscription: a form of non-monotonic reasoning

  1995cited by this paper
• On Compact Representations of Propositional Circumscription

  1995cited by this paper
• The Complexity of Propositional Closed World Reasoning and Circumscription

  1994cited by this paper
• Propositional circumscription and extended closed-world reasoning are ΠP2-complete

  1993cited by this paper
• Structure and importance of logspace-MOD class

  1992cited by this paper
• Structure and Importance of Logspace-MOD-Classes

  1991cited by this paper
• The Complexity of Closed World Reasoning and Circumscription

  1990cited by this paper
• On the Relationship Between Circumscription and Negation as Failure

  1989cited by this paper
• Satisfiability problems for propositional calculi

  1979cited by this paper
• The complexity of satisfiability problems

  1978cited by this paper
• The two-valued iterative systems of mathematical logic

  1942cited by this paper

• Modal Fragments

  2026cites this paper
• When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames

  2025cites this paper
• The Weight in Enumeration

  2016cites this paper
• A two-level on-line learning algorithm of Artificial Neural Network with forward connections

  2014cites this paper
• Tableau vs. Sequent Calculi for Minimal Entailment

  2014cites this paper
• Checking the Size of Circumscribed Formulae

  2014cites this paper
• On the Complexity of Modal Logic Variants and their Fragments

  2011cites this paper
• Complexity of logic-based argumentation in Post's framework

  2011cites this paper
• Complexity Classifications for Propositional Abduction in Post's Framework

  2010cites this paper
• Complexity of non-monotonic logics

  2010cites this paper
• The Complexity of Reasoning for Fragments of Autoepistemic Logic

  2010influential citation
• Sets of Boolean Connectives That Make Argumentation Easier

  2010cites this paper
• The Bulletin of the EATCS

  year unknowncites this paper