Pages that link to "Item:Q1205713"

The following pages link to The complexity of model checking for circumscriptive formulae (Q1205713):

Displaying 20 items.

• Generating all maximal models of a Boolean expression (Q294760) (← links)
• On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
• On the Boolean connectivity problem for Horn relations (Q608293) (← links)
• Trichotomies in the complexity of minimal inference (Q692908) (← links)
• Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
• On the counting complexity of propositional circumscription (Q963360) (← links)
• Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
• Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
• The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
• On compact representations of propositional circumscription (Q1391128) (← links)
• Reducing belief revision to circumscription (and vice versa) (Q1402725) (← links)
• Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
• Preprocessing of intractable problems (Q1854544) (← links)
• The complexity of minimal satisfiability problems (Q1887137) (← links)
• On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
• Graph-based construction of minimal models (Q2093381) (← links)
• Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
• An incremental algorithm for generating all minimal models (Q2457647) (← links)
• Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
• Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs (Q2884255) (← links)