Complexity of Default Logic on Generalized Conjunctive Queries

DOI10.1007/978-3-540-72200-7_7zbMath1149.68418OpenAlexW93845155MaRDI QIDQ5425398

Miki Hermann, Ilka Schnoor, Philippe Chapdelaine

Publication date: 13 November 2007

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72200-7_7

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (4)

Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs ⋮ What makes propositional abduction tractable ⋮ The Complexity of Reasoning for Fragments of Default Logic ⋮ Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?

This page was built for publication: Complexity of Default Logic on Generalized Conjunctive Queries