First-order logic as a constraint programming language

DOI10.1007/3-540-36078-6_2MaRDI QIDQ4428289zbMATH OpenFDO

Authors Krzysztof R. Apt, C. F. M. Vermeulen

Publication date 15 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2514/25140019.htm

Mathematics Subject Classification ID

Classical first-order logic (03B10) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• A denotational semantics for first-order logic
• Logic programs with stable model semantics as a constraint programming paradigm
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• Constraint propagation for first-order logic and inductive definitions
• On logical constraints in logic programming

Cited in

(12)

• The complexity of propositional closed world reasoning and circumscription
• Institutions for logic programming
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Multimodal logic programming
• Kernel-LEAF: A logic plus functional language
• Attacking fair-exchange protocols: parallel models vs. trace models
• scientific article; zbMATH DE number 4145877 (Why is no real title available?)
• scientific article; zbMATH DE number 51768 (Why is no real title available?)
• Formulas as programs
• scientific article; zbMATH DE number 2090047 (Why is no real title available?)
• Proof methods of declarative properties of definite programs
• Comparative metric semantics for concurrent PROLOG

This page was built for publication: First-order logic as a constraint programming language

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