Results 1  10
of
32
Automating FirstOrder Relational Logic
, 2000
"... An analysis is described that can automatically find models of firstorder formulas with relational operators and scalar quantifiers. The formula is translated to a quantifierfree boolean formula that has a model exactly when the original formula has a model within a given scope (that is, involving ..."
Abstract

Cited by 140 (22 self)
 Add to MetaCart
An analysis is described that can automatically find models of firstorder formulas with relational operators and scalar quantifiers. The formula is translated to a quantifierfree boolean formula that has a model exactly when the original formula has a model within a given scope (that is, involving no more than some finite number of atoms). The paper presents a simple logic and gives a compositional translation scheme. It reports on the use of Alcoa, a tool based on the scheme, to analyze a variety of specifications expressed in Alloy, an object modelling notation based on the logic.
Kodkod: A relational model finder
 of Lecture
"... Abstract. The key design challenges in the construction of a SATbased relational model finder are described, and novel techniques are proposed to address them. An efficient model finder must have a mechanism for specifying partial solutions, an effective symmetry detection and breaking scheme, and ..."
Abstract

Cited by 103 (11 self)
 Add to MetaCart
Abstract. The key design challenges in the construction of a SATbased relational model finder are described, and novel techniques are proposed to address them. An efficient model finder must have a mechanism for specifying partial solutions, an effective symmetry detection and breaking scheme, and an economical translation from relational to boolean logic. These desiderata are addressed with three new techniques: a symmetry detection algorithm that works in the presence of partial solutions, a sparsematrix representation of relations, and a compact representation of boolean formulas inspired by boolean expression diagrams and reduced boolean circuits. The presented techniques have been implemented and evaluated, with promising results. 1
2001b, ‘The CADE17 ATP System Competition
 Journal of Automated Reasoning
"... Abstract. The results of the IJCAR ATP System Competition are presented. ..."
Abstract

Cited by 32 (7 self)
 Add to MetaCart
(Show Context)
Abstract. The results of the IJCAR ATP System Competition are presented.
IsomorphFree Model Enumeration: A New Method for Checking Relational Specifications
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1998
"... This article describes a technique for analyzing relational specifications. The underlying idea is very simple. Both simulation and checking amount to finding models of a relational formula, i.e., assignments for which the formula is true. For simulation the formula is the description of the operati ..."
Abstract

Cited by 21 (11 self)
 Add to MetaCart
This article describes a technique for analyzing relational specifications. The underlying idea is very simple. Both simulation and checking amount to finding models of a relational formula, i.e., assignments for which the formula is true. For simulation the formula is the description of the operation; for checking, the formula is the negation of an assertion about an operation. Models are found by a generateandtest strategy: the formula is repeatedly evaluated for a series of assignments until one is found for which the formula is true
Detecting Unsolvable Queries for Definite Logic Programs
, 1998
"... In logic programming, almost no work has been done so far on proving that certain queries cannot succeed. Work in this direction could be useful for queries which seem to be nonterminating. Such queries are not exceptional, e.g. in planning problems. The paper develops some methods, based on ab ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
(Show Context)
In logic programming, almost no work has been done so far on proving that certain queries cannot succeed. Work in this direction could be useful for queries which seem to be nonterminating. Such queries are not exceptional, e.g. in planning problems. The paper develops some methods, based on abduction, goaldirectedness, tabulation, and constraint techniques, for proving failure of queries for definite logic programs. It also reports some experiments with various tools.
The Design of a Relational Engine
 In Foundations of Software Engineering
, 2006
"... The Design of a Relational Engine The key design challenges in the construction of a SATbased relational engine are described, and novel techniques are proposed to address them. An efficient engine must have a mechanism for specifying partial solutions, an effective symmetry detection and breaking ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
The Design of a Relational Engine The key design challenges in the construction of a SATbased relational engine are described, and novel techniques are proposed to address them. An efficient engine must have a mechanism for specifying partial solutions, an effective symmetry detection and breaking scheme, and an economical translation from relational to boolean logic. These desiderata are addressed with three new techniques: a symmetry detection algorithm that works in the presence of partial solutions, a sparsematrix representation of relations, and a compact representation of boolean formulas inspired by boolean expression diagrams and reduced boolean circuits. The presented techniques have been implemented and evaluated, with promising results.
Satchmo  The Compiling and Functional Variants
 JOURNAL OF AUTOMATED REASONING
, 1997
"... Compiling Satchmo and Functional Satchmo are two variants of the model generator Satchmo, incorporating enhancements in different directions. Compiling Satchmo is based on the observation that Satchmo (like any model generator or theorem prover) can be seen as an interpreter for a program given as a ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Compiling Satchmo and Functional Satchmo are two variants of the model generator Satchmo, incorporating enhancements in different directions. Compiling Satchmo is based on the observation that Satchmo (like any model generator or theorem prover) can be seen as an interpreter for a program given as a logical theory, and that this interpretation layer can be avoided by compilation of the theory into a directly executable program. Functional Satchmo is an implementation of Satchmo's calculus in a purely functional language supporting lazy evaluation.
Communication formalisms for automated theorem proving tools
 PROC. OF IJCAI18 WORKSHOP ON AGENTS AND AUTOMATED REASONING
, 2003
"... This paper describes two communication formalisms for Automated Theorem Proving (ATP) tools. First, a problem and solution language has been designed. The language will be used for writing problems to be input to ATP systems, and for writing solutions output by ATP systems. Second, a hierarchy of re ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This paper describes two communication formalisms for Automated Theorem Proving (ATP) tools. First, a problem and solution language has been designed. The language will be used for writing problems to be input to ATP systems, and for writing solutions output by ATP systems. Second, a hierarchy of result statuses, which adequately express the range of results output by ATP systems, has been established. These formalisms will support application and research in ATP, and will facilitate direct communication between ATP tools when they are used as embedded components in larger systems.
Specifying latin square problems in propositional logic
 In Automated Reasoning and Its Applications
, 1997
"... ..."
(Show Context)