HARP: a tableau-based theorem prover
Journal of Automated Reasoning
Query evaluation in recursive databases: bottom-up and top-down reconciled
Data & Knowledge Engineering
Design of the kernel language for the parallel inference machine
The Computer Journal - On concurrent logic programming
Finite domain constraint solving and constraint logic programming
Constraint logic programming
HELIC-II: legal reasoning system on the parallel inference machine
Selected papers of international conference on Fifth generation computer systems 92
Reasoning about priorities in default logic
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Lazy Model Generation For Improving The Efficiency of Forward Reasoning Theorem Provers
Proceedings of the IFIP TC12/WG12.3 International Workshop on Automated Reasoning
Adding Priorities and Specificity to Default Logic
JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
A Tableau Calculus for Minimal Model Reasoning
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Moder Generation Theorem Proving with Finite Interval Constraints
CL '00 Proceedings of the First International Conference on Computational Logic
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
Experiments in Automated Deduction with Condensed Detachment
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Embedding Negation as Failure into a Model Generation Theorem Prover
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Efficient Model Generation through Compilation
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
On the Relationship Between Non-Horn Magic Sets and Relevancy Testing
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Efficient Minimal Model Generation Using Branching Lemmas
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Incorporating Relevancy Testing in SATCHMO
Incorporating Relevancy Testing in SATCHMO
Well-founded semantics for extended logic programs with dynamic preferences
Journal of Artificial Intelligence Research
Preferred subtheories: an extended logical framework for default reasoning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Automatic generation of some results in finite algebra
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Bottom-up abduction by model generation
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
How to prefer more specific defaults in terminological default logic
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Proof simplification for model generation and its applications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
| Hi-index | 0.01 |
This paper describes the major results on research and development of a model generation theorem prover MGTP. It exploits OR parallelism for non-Horn problems and AND parallelism for Horn problems achieving more than a 200-fold speedup on a parallel inference machine PIM with 256 processing elements. With MGTP, we succeeded in proving difficult mathematical problems that cannot be proven on sequential systems, including several open problems in finite algebra.To enhance the pruning ability of MGTP, several new features are added to it. These include: CMGTP and IV-MGTP to deal with constraint satisfaction problems, enabling negative and interval constraint propagation, respectively, non-Horn magic set to suppress the generation of useless model candidates caused by irrelevant clauses, a proof simplification method to eliminate duplicated subproofs, and MM-MGTP for minimal model generation.We studied several techniques necessary for the development of applications, such as negation as failure, abductive reasoning and modal logic systems, on MGTP. These techniques share a basic idea, which is to use MGTP as a meta-programming system for each application.