FO(ID) as an extension of DL with rules

DOI10.1007/s10472-010-9207-9zbMath1205.68409OpenAlexW2092768359MaRDI QIDQ604911

Marc Denecker, Maurice Bruynooghe, Joost Vennekens

Publication date: 12 November 2010

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-010-9207-9

zbMATH Keywords

knowledge representationlogic programmingdescription logicsFO(ID)

Mathematics Subject Classification ID

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

Related Items (3)

Three-valued semantics for hybrid MKNF knowledge bases revisited ⋮ Well-founded operators for normal hybrid MKNF knowledge bases ⋮ Flexible Approximators for Approximating Fixpoint Theory

Uses Software

• swrl

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The alternating fixpoint of logic programs with negation
• Elementary induction on abstract structures
• Expressive equivalence of least and inflationary fixed-point logic
• Combining answer set programming with description logics for the semantic web
• Weak Second‐Order Arithmetic and Finite Automata
• Guarded hybrid knowledge bases
• Reconciling description logics and rules
• Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions

This page was built for publication: FO(ID) as an extension of DL with rules