Logic programming with infinite sets

DOI10.1007/S10472-005-7030-5MaRDI QIDQ812390zbMATH OpenOpenAlexFDO

Authors Douglas Cenzer, Wiktor Marek, Jeffrey Remmel

Publication date 23 January 2006

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

Full work available at URL https://doi.org/10.1007/s10472-005-7030-5

zbMATH Keywords

logic programmingnonmonotonic logic

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27) Logic in computer science (03B70)

Recommendations

• Logic programming with sets
• scientific article; zbMATH DE number 139622
• Effectively reasoning about infinite sets in answer set programming
• scientific article; zbMATH DE number 3888910
• Computing with infinitary logic
• Toward a declarative semantics for infinite objects in logic programming
• Infinitary logic for computer science
• Semantics of infinite tree logic programming
• Logic Programming and Effectively Closed Sets
• scientific article; zbMATH DE number 4043305

Cites work

• scientific article; zbMATH DE number 4147557 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3577197 (Why is no real title available?)
• scientific article; zbMATH DE number 2079046 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• scientific article; zbMATH DE number 1884395 (Why is no real title available?)
• scientific article; zbMATH DE number 1884404 (Why is no real title available?)
• scientific article; zbMATH DE number 1890624 (Why is no real title available?)
• scientific article; zbMATH DE number 1395614 (Why is no real title available?)
• scientific article; zbMATH DE number 1453071 (Why is no real title available?)
• scientific article; zbMATH DE number 3188506 (Why is no real title available?)
• BerkMin: A fast and robust SAT-solver
• Extending and implementing the stable model semantics
• Extending the Smodels system with cardinality and weight constraints
• Index sets for \(\Pi^0_1\) classes
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Locally determined logic programs and recursive stable models
• Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• Logic programming and knowledge representation---The A-Prolog perspective
• Logic programs with stable model semantics as a constraint programming paradigm
• Reasoning with infinite stable models
• The Stable Models of a Predicate Logic Program
• The expressiveness of locally stratified programs
• {log}: A language for programming in logic with finite sets

Cited in

(12)

• Logic programming with sets
• Index sets for finite normal predicate logic programs with function symbols
• Recurrence domains: Their unification and application to logic programming
• Semantics of infinite tree logic programming
• Computing with infinitary logic
• Effectively reasoning about infinite sets in answer set programming
• LOIS: syntax and semantics
• My work with Victor Marek: a mathematician looks at answer set programming
• scientific article; zbMATH DE number 4009812 (Why is no real title available?)
• scientific article; zbMATH DE number 3888910 (Why is no real title available?)
• Certified reasoning with infinity
• scientific article; zbMATH DE number 176722 (Why is no real title available?)

Describes a project that uses

Uses Software

• ASSAT
• Smodels
• Chaff
• BerkMin

This page was built for publication: Logic programming with infinite sets

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