Logic programming with bounded quantifiers

DOI10.1007/3-540-55460-2_37MaRDI QIDQ4264062zbMATH OpenFDO

Authors Andrei Voronkov

Publication date 21 September 1999

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

Full work available at URL https://doi.org/10.1007/3-540-55460-2_37

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic with extra quantifiers and operators (03C80) Logic programming (68N17)

Recommendations

• Bounded nondeterminism of logic programs
• Bounded quantifications for iteration and concurrency in logic programming
• Quantified logic programs, revisited
• Generalized quantifiers in logic programs
• Qualified logic programming with bivalued predicates
• Quantitative Logic Programming Revisited
• scientific article; zbMATH DE number 3845549
• scientific article; zbMATH DE number 970730
• Bounded combinatory logic
• Logic programming with satisfiability

Cited in

(11)

• Bounded quantifications for iteration and concurrency in logic programming
• scientific article; zbMATH DE number 4137744 (Why is no real title available?)
• scientific article; zbMATH DE number 516984 (Why is no real title available?)
• scientific article; zbMATH DE number 1954107 (Why is no real title available?)
• scientific article; zbMATH DE number 7368413 (Why is no real title available?)
• scientific article; zbMATH DE number 970730 (Why is no real title available?)
• scientific article; zbMATH DE number 2242590 (Why is no real title available?)
• Blackboard relations in the \(\mu\text{Log}\) coordination model
• Bounded nondeterminism of logic programs
• Logic programming with sets
• Absolute versus probabilistic classification in a logical setting

This page was built for publication: Logic programming with bounded quantifiers

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