Pages that link to "Item:Q1329160"

The following pages link to The complexity of propositional closed world reasoning and circumscription (Q1329160):

Displaying 30 items.

• On the parameterized complexity of non-monotonic logics (Q494658) (← links)
• The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
• Trichotomies in the complexity of minimal inference (Q692908) (← links)
• Complexity of counting the optimal solutions (Q837174) (← links)
• Logic and social cognition. The facts matter, and so do computational models (Q843769) (← links)
• Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
• Saturation, nonmonotonic reasoning and the closed-world assumption (Q1060864) (← links)
• Closed-world databases and circumscription (Q1079022) (← links)
• Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
• Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
• On compact representations of propositional circumscription (Q1391128) (← links)
• Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
• Reducing belief revision to circumscription (and vice versa) (Q1402725) (← links)
• Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
• On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) (← links)
• On the complexity of data disjunctions. (Q1853503) (← links)
• Tractable reasoning via approximation (Q1855213) (← links)
• On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
• Formalizing GDPR provisions in reified I/O logic: the DAPRECO knowledge base (Q2228447) (← links)
• Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
• Backdoors to tractable answer set programming (Q2341833) (← links)
• Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
• Combining answer set programming with description logics for the semantic web (Q2389666) (← links)
• A theoretical framework on proactive information exchange in agent teamwork (Q2457648) (← links)
• Knowledge compilation for closed world reasoning and circumscription (Q2761752) (← links)
• Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs (Q2884255) (← links)
• Complexity of Counting the Optimal Solutions (Q3511323) (← links)
• Logic for Programming, Artificial Intelligence, and Reasoning (Q5705928) (← links)
• Reasoning on with Defeasibility in ASP (Q6063881) (← links)