Logic programming revisited

DOI10.1145/383779.383789zbMath1365.68148OpenAlexW2076652224MaRDI QIDQ5738920

Marc Denecker, Maurice Bruynooghe, Victor W. Marek

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/383779.383789

zbMATH Keywords

inductive definitionsepistemological foundations

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (8)

Truth versus information in logic programming ⋮ Ultimate approximation and its application in nonmonotonic knowledge representation systems ⋮ A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs ⋮ Inference and learning in probabilistic logic programs using weighted Boolean formulas ⋮ Contextual hypotheses and semantics of logic programs ⋮ Inductive situation calculus ⋮ Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic ⋮ Proof-theoretic semantics, self-contradiction, and the format of deductive reasoning

This page was built for publication: Logic programming revisited