Logic for Programming, Artificial Intelligence, and Reasoning

DOI10.1007/b106931zbMath1108.68580OpenAlexW4206255911MaRDI QIDQ5705928

Gustav Nordh

Publication date: 10 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b106931

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

What makes propositional abduction tractable ⋮ On the parameterized complexity of non-monotonic logics ⋮ The complexity of circumscriptive inference in Post's lattice ⋮ Trichotomies in the complexity of minimal inference ⋮ The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments ⋮ Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?

This page was built for publication: Logic for Programming, Artificial Intelligence, and Reasoning