Foundations of Information and Knowledge Systems

DOI10.1007/11663881zbMath1177.68041OpenAlexW4212786759MaRDI QIDQ5898544

Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir

Publication date: 12 February 2007

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

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17)

Related Items (2)

Reasoning with Forest Logic Programs Using Fully Enriched Automata ⋮ $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols

This page was built for publication: Foundations of Information and Knowledge Systems