Constraint solving for proof planning
From MaRDI portal
Publication:1774557
DOI10.1007/s10817-004-2725-6zbMath1071.68093OpenAlexW1979721470MaRDI QIDQ1774557
Publication date: 17 May 2005
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-004-2725-6
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rippling: A heuristic for guiding inductive proofs
- Challenge problems in elementary calculus
- Network-based heuristics for constraint-satisfaction problems
- A theory of abstraction
- Consistency in networks of relations
- The TPTP problem library. CNF release v1. 2. 1
- A resolution principle for constrained logics
- The Heine-Borel challenge problem. In honor of Woody Bledsoe
- Comparing approaches to the exploration of the domain of residue classes.
- Automated deduction by theory resolution
- Knowledge-based proof planning
- STRIPS: A new approach to the application of theorem proving to problem solving
- Computer proofs of limit theorems
- Combining linear programming and satisfiability solving for resource planning
- New methods to color the vertices of a graph
- Term Rewriting and All That