Compiling input^ FO() inductive definitions into tabled prolog rules for IDP3

DOI10.1017/S1471068413000434zbMATH Open1286.68047MaRDI QIDQ5398305FDOQ5398305

Authors: Joachim Jansen, Albert Jorissen, Gerda Janssens 

Publication date: 27 February 2014

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

Recommendations

• Logic Programming
• Grounding FO and FO(ID) with bounds
• Satisfiability Checking for PC(ID)
• Integrating Inductive Definitions in SAT
• Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3

zbMATH Keywords

logic programmingprogram transformationdeclarative modelingknowledge base systemstablingIDP systemFO\((\cdot)\)

Mathematics Subject Classification ID

Logic programming (68N17) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70)

Cites Work

• XSB: extending Prolog with tabled logic programming
• Logic programming and nonmonotonic reasoning. 11th international conference, LPNMR 2011, Vancouver, Canada, May 16--19, 2011. Proceedings

Cited In (4)

• Grounding FO and FO(ID) with bounds
• Writing declarative specifications for clauses
• Terminating evaluation of logic programs with finite three-valued models
• Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3

Uses Software

• XSB

This page was built for publication: Compiling \(\mathrm{input}^\ast\) FO\((\cdot)\) inductive definitions into tabled prolog rules for IDP3

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