Open answer set programming for the semantic web

DOI10.1016/J.JAL.2006.02.001MaRDI QIDQ881833zbMATH OpenOpenAlexFDO

Authors Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir

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

zbMATH Keywords

answer set programmingdescription logicssemantic webopen domain reasoning

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Combining answer set programming with description logics for the semantic web
• Reasoning with forest logic programs and f-hybrid knowledge bases
• Reasoning with forest logic programs using fully enriched automata
• Logic Programming
• Well-founded semantics for description logic programs in the semantic web

Cites work

• scientific article; zbMATH DE number 1223729 (Why is no real title available?)
• scientific article; zbMATH DE number 592370 (Why is no real title available?)
• scientific article; zbMATH DE number 1059246 (Why is no real title available?)
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• scientific article; zbMATH DE number 1765711 (Why is no real title available?)
• scientific article; zbMATH DE number 1405450 (Why is no real title available?)
• A guide to completeness and complexity for modal logics of knowledge and belief
• Answer set programming and plan generation
• Attributive concept descriptions with complements
• Automated Deduction – CADE-19
• Combining answer set programming with description logics for the semantic web
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Modal languages and bounded fragments of predicate logic
• Negation as failure in the head
• On the relative expressiveness of description logics and predicate logics
• Reasoning with infinite stable models
• The Computational Complexity of Provability in Systems of Modal Propositional Logic

Cited in

(11)

• Local closed world reasoning with description logics under the well-founded semantics
• A formal model of semantic computing
• On the relation between SPARQL1.1 and Answer Set Programming
• Reasoning with forest logic programs using fully enriched automata
• Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin
• Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
• Answer Set Programming: A Primer
• Conceptual logic programs
• Reasoning with forest logic programs and f-hybrid knowledge bases
• Open answer set programming with guarded programs
• Efficiently Querying RDF(S) Ontologies with Answer Set Programming

Describes a project that uses

Uses Software

• Racer
• swrl

This page was built for publication: Open answer set programming for the semantic web

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q881833)