Algorithms on atomic representations of herbrand models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1489, Issue , 1998, Pages 199-215

  Pichler, Reinhard ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ATOMS; DECISION THEORY; EFFICIENCY; EQUIVALENCE CLASSES; SEMANTICS;

AUTOMATED DEDUCTION; COUNTER-MODELS; DECISION PROBLEMS; EVALUATION PROBLEMS; HERBRAND MODEL; INPUT MODELING; PARTIAL SATURATION; UPPER BOUND;

COMPUTATIONAL COMPLEXITY;

EID: 22444456455     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49545-2_14     Document Type: Conference Paper

References (8)

1. H. Comon, P. Lescanne: Equational Problems and Disunification, Journal of Symbolic Computation, Vol 7, pp. 371-425 (1989).
2. R. Caferra, N. Zabel: Extending Resolution for Model Construction, in Proceedings of JELIA '90, LNAI 478, pp. 153-169, Springer (1991).
3. C. Fermüller, A. Leitsch: Hyperresolution and Automated Model Building, Journal of Logic and Computation, Vol 6 No 2, pp. 173-230 (1996).
4. G. Gottlob: The Equivalence Problem for Herbrand Interpretations, unpublished note (1997).
5. A. Leitsch: The Resolution Calculus, Texts in Theoretical Computer Science, Springer (1997).
6. J.-L. Lassez, K. Marriott: Explicit Representation of Terms defined by Counter Examples, Journal of Automated Reasoning, Vol 3, pp. 301-317 (1987).
7. R. Matzinger: Comparing Computational Representations of Herbrand Models, in Proceedings of KGC'97, LNCS 1289, Springer (1997).
8. R. Pichler: Algorithms on Atomic Representations of Herbrand Models, technical report TR-CS-RP-98-1 of the Technical University of Vienna, available as ftp://ftp.logic.at/pub/reini/armod.ps (1998).