FO(FD): Extending classical logic with rule-based fixpoint definitions

DOI10.1017/S1471068410000293zbMath1209.68094arXiv1007.3819OpenAlexW2006396461MaRDI QIDQ3585169

Broes de Cat, Marc Denecker, Ping Hou

Publication date: 19 August 2010

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.3819

zbMATH Keywords

fixpoint definitionsclassical logic extensionsfixpoint constructs

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items (5)

On Nested Justification Systems ⋮ A Formal Theory of Justifications ⋮ Recursive rules with aggregation: a simple unified semantics ⋮ Justifications and a reconstruction of parity game solving algorithms ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Stable models and difference logic
• The expressive powers of the logic programming semantics
• A logic of nonmonotone inductive definitions
• Abductive Logic Programming
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: FO(FD): Extending classical logic with rule-based fixpoint definitions