Propositional calculus problems in CHIP
From MaRDI portal
Publication:5096196
DOI10.1007/3-540-53162-9_39zbMath1493.68077OpenAlexW1500415104MaRDI QIDQ5096196
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Classical propositional logic (03B05) Logic programming (68N17)
Related Items
Cites Work
- Embedding Boolean expressions into logic programming
- Consistency in networks of relations
- A language and a program for stating and solving combinatorial problems
- Boolean unification - the story so far
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Algorithms for testing the satisfiability of propositional formulae
- Diagnosis of Automata Failures: A Calculus and a Method
- A Computing Procedure for Quantification Theory
- Solving large combinatorial problems in logic programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item