Propositional calculus problems in CHIP

DOI10.1007/3-540-53162-9_39MaRDI QIDQ5096196zbMATH OpenOpenAlexFDO

Authors Helmut Simonis, Mehmet Dincbas

Publication date 16 August 2022

Published in Algebraic and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53162-9_39

Mathematics Subject Classification ID

Classical propositional logic (03B05) Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A logic language for combinatorial optimization
• Solving propositional satisfiability problems
• Solving large combinatorial problems in logic programming
• A simple and efficient Boolean solver for constraint logic programming
• scientific article; zbMATH DE number 1882048

Cites work

• A Computing Procedure for Quantification Theory
• A language and a program for stating and solving combinatorial problems
• Algorithms for testing the satisfiability of propositional formulae
• Boolean unification - the story so far
• Consistency in networks of relations
• Diagnosis of Automata Failures: A Calculus and a Method
• Embedding Boolean expressions into logic programming
• scientific article; zbMATH DE number 3871321 (Why is no real title available?)
• scientific article; zbMATH DE number 4094866 (Why is no real title available?)
• scientific article; zbMATH DE number 4104410 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3568056 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Solving large combinatorial problems in logic programming

Cited in

(8)

• Linear programs for constraint satisfaction problems
• Negative Boolean constraints
• Constrained pseudo-propositional logic
• scientific article; zbMATH DE number 1705165 (Why is no real title available?)
• scientific article; zbMATH DE number 1852952 (Why is no real title available?)
• Solving large combinatorial problems in logic programming
• Constraint programming for modelling and solving modal satisfiability
• A logic language for combinatorial optimization

This page was built for publication: Propositional calculus problems in CHIP

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