Tractable reasoning in artificial intelligence
From MaRDI portal
Publication:1894662
DOI10.1007/3-540-60058-2zbMath0840.68109OpenAlexW1483583128MaRDI QIDQ1894662
Publication date: 7 August 1995
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60058-2
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Knowledge representation (68T30) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
Unnamed Item, Fixed-parameter tractability of disjunction-free default reasoning, Annotation theories over finite graphs, Constraints on extensions of a default theory, More on representation theory for default logic