Results 1 
3 of
3
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
 Journal of Automated Reasoning
, 2000
"... . Minimal Herbrand models of sets of firstorder clauses are useful in several areas of computer science, e.g. automated theorem proving, program verification, logic programming, databases, and artificial intelligence. In most cases, the conventional model generation algorithms are inappropriate bec ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
. Minimal Herbrand models of sets of firstorder clauses are useful in several areas of computer science, e.g. automated theorem proving, program verification, logic programming, databases, and artificial intelligence. In most cases, the conventional model generation algorithms are inappropriate because they generate nonminimal Herbrand models and can be inefficient. This article describes an approach for generating the minimal Herbrand models of sets of firstorder clauses. The approach builds upon positive unit hyperresolution (PUHR) tableaux, that are in general smaller than conventional tableaux. PUHR tableaux formalize the approach initially introduced with the theorem prover SATCHMO. Two minimal model generation procedures are described. The first one expands PUHR tableaux depthfirst relying on a complement splitting expansion rule and on a form of backtracking involving constraints. A Prolog implementation, named MMSATCHMO, of this procedure is given and its performance on ben...
Massively Parallel Reasoning
, 1998
"... this article we do not distinguish between connectionist systems and articial neural networks. We prefer the term connectionist system as it expresses the fact that we are dealing with a computational model, where most of the knowledge is encoded in the connections between simple computing units. ..."
Abstract
 Add to MetaCart
this article we do not distinguish between connectionist systems and articial neural networks. We prefer the term connectionist system as it expresses the fact that we are dealing with a computational model, where most of the knowledge is encoded in the connections between simple computing units.
A Basis for Model Computation in Free Data Types
 In CADE17, Workshop on Model Computation  Principles, Algorithmns, Applications
, 2000
"... Abstract data types are specied by some equality logic under the assumption of term generatedness. They are called `free', if terms, built only by constructors, are semantically unique. This paper presents a calculus, intended to search for models of free data type specications. A semantical vie ..."
Abstract
 Add to MetaCart
Abstract data types are specied by some equality logic under the assumption of term generatedness. They are called `free', if terms, built only by constructors, are semantically unique. This paper presents a calculus, intended to search for models of free data type specications. A semantical view is discussed, where the uniqueness of constructor terms is `hard wired'. This suggests an explicit reasoning about interpretations instead of performing real equality reasoning. The rules, which depend on signature, constructor denitions and axioms, are formulated as range restricted clauses. This allows to `perform' the calculus simply by calling a model generation prover, in particular the MGTP system.