Logic programming with infinite sets

DOI10.1007/s10472-005-7030-5zbMath1086.68126OpenAlexW2051739852MaRDI QIDQ812390

Douglas Cenzer, Victor W. Marek, Jeffery B. 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

nonmonotonic logiclogic programming

Mathematics Subject Classification ID

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

Related Items (1)

My work with Victor Marek: a mathematician looks at answer set programming

Uses Software

• ASSAT
• Smodels
• Chaff
• BerkMin

Cites Work

• Reasoning with infinite stable models
• Index sets for \(\Pi^0_1\) classes
• Locally determined logic programs and recursive stable models
• Logic programming and knowledge representation---The A-Prolog perspective
• Extending and implementing the stable model semantics
• The expressiveness of locally stratified programs
• Logic programs with stable model semantics as a constraint programming paradigm
• BerkMin: A fast and robust SAT-solver
• {log}: A language for programming in logic with finite sets
• The Stable Models of a Predicate Logic Program
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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