The complexity of propositional closed world reasoning and circumscription (Q1329160): Difference between revisions

@@ Property / cites work @@
+Q4428289
@@ Property / cites work: Q4428289 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3750100
@@ Property / cites work: Q3750100 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of abduction
@@ Property / cites work: The computational complexity of abduction / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of model checking for circumscriptive formulae
+Normal rank
@@ Property / cites work @@
+An efficient method for eliminating varying predicates from a circumscription
+Normal rank
@@ Property / cites work @@
+A survey of complexity results for non-monotonic logics
+Normal rank
@@ Property / cites work @@
+Eliminating the fixed predicates from a circumscription
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for testing the satisfiability of propositional horn formulae
+Normal rank
@@ Property / cites work @@
+Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Negation as failure: careful closure procedure
@@ Property / cites work: Negation as failure: careful closure procedure / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm to compute circumscription
@@ Property / cites work: An algorithm to compute circumscription / rank @@
+Normal rank
@@ Property / cites work @@
+A circumscriptive theorem prover
@@ Property / cites work: A circumscriptive theorem prover / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385525
@@ Property / cites work: Q4385525 / rank @@
+Normal rank
@@ Property / cites work @@
+Hard problems for simple default logics
@@ Property / cites work: Hard problems for simple default logics / rank @@
+Normal rank
@@ Property / cites work @@
+Some computational aspects of circumscription
@@ Property / cites work: Some computational aspects of circumscription / rank @@
+Normal rank
@@ Property / cites work @@
+Why not negation by fixpoint?
@@ Property / cites work: Why not negation by fixpoint? / rank @@
+Normal rank
@@ Property / cites work @@
+Closed-world databases and circumscription
@@ Property / cites work: Closed-world databases and circumscription / rank @@
+Normal rank
@@ Property / cites work @@
+Circumscription - a form of non-monotonic reasoning
+Normal rank
@@ Property / cites work @@
+Q3939270
@@ Property / cites work: Q3939270 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal consequence in sentential logic
@@ Property / cites work: Minimal consequence in sentential logic / rank @@
+Normal rank
@@ Property / cites work @@
+Weak generalized closed world assumption
@@ Property / cites work: Weak generalized closed world assumption / rank @@
+Normal rank
@@ Property / cites work @@
+A logic for default reasoning
@@ Property / cites work: A logic for default reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of diagnosis from first principles
@@ Property / cites work: A theory of diagnosis from first principles / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3200595
@@ Property / cites work: Q3200595 / rank @@
+Normal rank
@@ Property / cites work @@
+The decision problem for database dependencies
@@ Property / cites work: The decision problem for database dependencies / rank @@
+Normal rank
@@ Property / cites work @@
+Querying logical databases
@@ Property / cites work: Querying logical databases / rank @@
+Normal rank
@@ Property / cites work @@
+Deduction in non-Horn databases
@@ Property / cites work: Deduction in non-Horn databases / rank @@
+Normal rank