Please use this identifier to cite or link to this item:
|Title:||Representing Herbrand Models by Grammars and Deciding Equivalence Efficiently||Authors:||Matzinger, Robert||Issue Date:||20-Jan-1996||Series/Report no.:||Technische Universität Wien;TR-WB-Mat-96-1||Abstract:||Finding computationally valuable representations of models of predicate logic formulas is an important subtask in many fields related to automated theorem proving, e.g. automated model building or semantic resolution. In this article we investigate the use of context-free languages for representing single Herbrand models, emphasizing algorithmic issues like the equivalence test (which we solve by applying methods of automated theorem proving again), clause evaluation, etc. Surprisingly our representation turns out to be a natural extension of "linear atomic representations", already known from the literature. By sketching additional results and questions we try to prove our approach to be an interesting base for investigating connections between formal language theory and automated theorem proving, leading to efficient methods for automated model building. 1 Introduction Representing Herbrand models of predicate logic formulas plays an important role in various subfields of automate...||URI:||http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.5662
|Appears in Collections:||Informationstechnologie und Informationsmanagement|
Show full item record
checked on Jul 25, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.