A Proof Strategy Based on a Dual Representation

Authors:
Guilherme Bittencourt;Isabel Tonin
Affiliations:
-;-
Venue:
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Year:
2000

Citing 16
Cited 0

First-order logic and automated theorem proving

First-order logic and automated theorem proving
An incremental method for generating prime implicants/implicates

Journal of Symbolic Computation
Computing prime implicants

CADE-10 Proceedings of the tenth international conference on Automated deduction
Optimizing the clausal normal form transformation

Journal of Automated Reasoning
Logic and logic programming

Communications of the ACM
Selection criteria for expert system shells: a socio-technical framework

Communications of the ACM
Methods and calculi for deduction

Handbook of logic in artificial intelligence and logic programming (vol. 1)
Deduction systems based on resolution

Handbook of logic in artificial intelligence and logic programming (vol. 1)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Theorem Proving via General Matings

Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
A Multi-Agent Approach to First-Order Logic

EPIA '97 Proceedings of the 8th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Dynamic Social Knowledge: A Cognitive Multi-Agent System Cooperation Strategy

ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
A New Algorithm for Generating Prime Implicants

IEEE Transactions on Computers
In the quest of the missing link

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Consolution and its relation with resolution

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe a first-order logic inference strategy based on information extracted from both conjunctive and disjunctive normal forms. We claim that the search problem for a proof can benefit from this further information, extending the heuristic possibilities of resolution and connection proof methods.