Computational representations of herbrand models using grammars

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

Volumn 1258, Issue , 1997, Pages 334-348

  Matzinger, Robert ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC LANGUAGES; AUTOMATION; COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; CONTEXT FREE LANGUAGES; FORMAL LANGUAGES; MODEL BUILDINGS; RECONFIGURABLE HARDWARE; SEMANTICS;

ALGORITHMIC ISSUES; AUTOMATED MODELING; AUTOMATED THEOREM PROVING; EQUIVALENCE TESTS; EXPRESSIVE POWER; FORMAL LANGUAGE THEORY; NATURAL EXTENSION; PREDICATE LOGIC;

THEOREM PROVING;

EID: 84958763737     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63172-0_48     Document Type: Conference Paper

References (21)

1. C. Bourely, R. Caferra, and N. Peltier. A method for building models automatically. Experiments with an extension of otter. In Alan Bundy, editor, 12th International Conference on Automated Deduction, pages 72-86, Nancy/France, June 1994. Springer Verlag, LNAI 814.
2. G. Boolos and R. Jeffrey. Computability and Logic. Cambridge University Press, 1974.
3. H. Chen, J. Hsiang, and H.-C. Kong. On finite representations of infinite sequences of terms. In S. Kaplan and M. Okada, editors, Proceedings 2nd International Workshop on Conditional and Typed Rewriting Systems, Montreal (Canada), volume 516 of Lecture Notes in Computer Science, pages 100-114. Springer, June 1990.
4. C.-L. Chang and R. C. T. Lee. Symbolic Logic an Mechanical Theorem Proving. Academic Press, New York, 1973.
5. H. Comon. On unification of terms with integer exponents. Mathematical Systems Theory, 28(1):67-88, 1995.
6. R. Caferra and N. Zabel. A method for simultanous search for refutations and models by equational constraint solving. Journal of Symbolic Computation, 13(6):613-641, June 1992.
7. C. Fermfiller. Deciding some Horn clause sets by resolution. In Yearbook of the Kurt-Gödel-Society 1989, pages 60-73, Vienna, 1990.
8. C. Fermüller and A. Leitsch. Model building by resolution. In Computer Science Logic (CSL'92), pages 134-148, San Miniato, Italy, 1993. Springer Verlag. LNCS 702.
9. C. Fermiiller and A. Leitsch. Hyperresolution and automated model building. J. of Logic and Computation, 6(2):173-203, 1996.
10. C. Fermiiller, A. Leitsch, T. Tammet, and N. Zamov. Resolution Methods for the Decision Problem. Springer Verlag: 1993. LNAI 679.
11. F. Gécseg and M. Steinby. Tree Automata. Akadémiai KiadS, Budapest, 1984.
12. M. Herraann and R. Galbaý: Unification of infinite sets of terms schematized by primal grammars. Theoretical Computer Science, 176, April 1997. To appear.
13. W.H. Joyner. Resolution strategies as decision procedures. Journal of ACM, 23(1):398-417, 1976.
14. D. Loveland. Automated Theorem Proving -- A Logical Basis. North Holland, 1978.
15. D. McAllester. Grammar rewriting. In D. Kapur, editor, Proceedings 11th International Conference on Automated Deduction, Saratoga Springs, (New York, USA), volume 607 of Lecture Notes in Computer Science (in Art. Intelligence). Springer, 1992.
16. G. Rozenberg and A. Salomaa, editors. Lindenmayer Systems. Springer, 1992.
17. A. Salomaa. Formal languages. Academic Press, Orlando, 1973.
18. G. Salzer. The unification of infinite sets of terms and its applications. In A. Voronkov, editor, Proceedings Logic Programming and Automated Reasoning, St. Petersburg (Russia), volume 624 of Lecture Notes in Computer Science (in Art. Intelligence). Springer, 1992.
19. J. Slaney. FINDER (finite domain enumerator): Notes and guide. Technical Report TR-ARP-1/92, Australien National University Automated Reasoning Project, Canberra, 1992.
20. J. Slaney. SCOTT: A model-guided theorem prover. In Proceedings of the 13th international joint conference on artificial intelligence (IJCAI '93), volume 1, pages 109-114. Morgan Kaufmann Publishers, 1993.
21. T. Tammet. Using resolution for deciding solvable classes and building finite models. In Baltic Computer Science, pages 33-64. Springer Verlag, 1991. LNCS 5O2.