A general setting for flexibly combining and augmenting decision procedures

Journal of Automated Reasoning

Volumn 28, Issue 3, 2002, Pages 257-305

  Janičić, Predrag ^a   Bundy, Alan ^b  

^a UNIVERSITY OF BELGRADE   (Serbia)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Augmentation of decision procedures; Combining decision procedures; Decision procedures; Theorem proving

Indexed keywords

DECISION SUPPORT SYSTEMS; DECISION THEORY; DIGITAL ARITHMETIC; FUNCTION EVALUATION; HEURISTIC METHODS; THEOREM PROVING;

AUGMENTATION DECISION PROCEDURES; COMBINING DECISION PROCEDURES; MACRO INFERENCE RULES;

INFERENCE ENGINES;

EID: 0036544332     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015707001763     Document Type: Article

References (50)

1. Constraint contextual rewriting
2. A practical extension mechanism for decision procedures
3. Termination of constraint contextual rewriting
4. On restrictions of ordered paramodulation with simplification
5. Strict basic superposition
6. Abstract congruence closure and specializations
7. Validity checking for combinations of theories with equality
8. A framework for cooperating decision procedures
9. Integrating decision procedures for temporal verification
10. Automated case analysis in proof by induction
11. Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic
12. The use of explicit plans to guide inductive proofs
13. A science of reasoning
14. The use of proof plans for normalization
15. The Oyster-Clam system
16. The use of proof planning in normalisation
17. Theorem proving in arithmetic without multiplication
18. EVES: An overview
19. On Shostak's decision procedure for combinations of theories
20. Ordering for term-rewriting systems
21. An overview of the extended static checking system
22. User guide for the EHDM specification language and verification system, version 6.1
23. Solving problems by formula manipulation in logic and linear inequalities
24. Strict general setting for building decision procedures into theorem provers
25. A framework for the flexible integration of a class of decision procedures into theorem provers
26. Shostak's congruence closure as completion
27. Reasoning about numbers in Tecton
28. Lemma discovery in automating induction
29. Using an induction prover for verifying arithmetic circuits
30. On Fourier's algorithm for linear arithmetic constraints
31. STeP: The Stanford temporal prover
32. Increasing the versatility of heuristic based theorem provers
33. On direct products of theories
34. Simplification by cooperating decision procedures
35. Fast decision procedures based on congruence closure
36. 22pm upper bound on the complexity of Presburger arithmetic
37. PVS: Combining specification, proof checking, and model checking
38. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt
39. Deconstructing Shostak
40. Deciding combinations of theories
41. Über einige Satzfunktionen in der Arithmetik
42. Presburger's article on integer arithmetic: Remarks and translation
43. A new correctness proof of the Nelson-Oppen combination procedure
44. Contextual rewriting in automated reasoning
45. First-order theorem proving using conditional rewrite rules
46. Contextual rewriting