Open answer set programming for the semantic web
From MaRDI portal
Publication:881833
DOI10.1016/J.JAL.2006.02.001zbMath1116.68092OpenAlexW2106354297MaRDI QIDQ881833
Dirk Vermeir, Davy Van Nieuwenborgh, Stijn Heymans
Publication date: 18 May 2007
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2006.02.001
Related Items (7)
Reasoning with Forest Logic Programs Using Fully Enriched Automata ⋮ Reasoning with Forest Logic Programs and f-hybrid knowledge bases ⋮ Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin ⋮ Local closed world reasoning with description logics under the well-founded semantics ⋮ Answer Set Programming: A Primer ⋮ A formal model of semantic computing ⋮ Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Attributive concept descriptions with complements
- Reasoning with infinite stable models
- A guide to completeness and complexity for modal logics of knowledge and belief
- Modal languages and bounded fragments of predicate logic
- Answer set programming and plan generation
- Combining answer set programming with description logics for the semantic web
- On the relative expressiveness of description logics and predicate logics
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Negation as failure in the head
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Automated Deduction – CADE-19
This page was built for publication: Open answer set programming for the semantic web
