Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,485
The logic of constraint satisfaction
, 1992
"... The constraint satisfaction problem (CSP) formalization has been a productive tool within Artificial Intelligence and related areas. The finite CSP (FCSP) framework is presented here as a restricted logical calculus within a space of logical representation and reasoning systems. FCSP is formulated i ..."
Abstract
-
Cited by 265 (5 self)
- Add to MetaCart
in a variety of logical settings: theorem proving in first order predicate calculus, propositional theorem proving (and hence SAT), the Prolog and Datalog approaches, constraint network algorithms, a logical interpreter for networks of constraints, the constraint logic programming (CLP) paradigm
Automating First-Order Relational Logic
, 2000
"... An analysis is described that can automatically find models of first-order formulas with relational operators and scalar quantifiers. The formula is translated to a quantifier-free boolean formula that has a model exactly when the original formula has a model within a given scope (that is, involving ..."
Abstract
-
Cited by 143 (23 self)
- Add to MetaCart
An analysis is described that can automatically find models of first-order formulas with relational operators and scalar quantifiers. The formula is translated to a quantifier-free boolean formula that has a model exactly when the original formula has a model within a given scope (that is
Computing With First-Order Logic
, 1995
"... We study two important extensions of first-order logic (FO) with iteration, the fixpoint and while queries. The main result of the paper concerns the open problem of the relationship between fixpoint and while: they are the same iff ptime = pspace. These and other expressibility results are obtaine ..."
Abstract
-
Cited by 55 (13 self)
- Add to MetaCart
We study two important extensions of first-order logic (FO) with iteration, the fixpoint and while queries. The main result of the paper concerns the open problem of the relationship between fixpoint and while: they are the same iff ptime = pspace. These and other expressibility results
On the Decision Problem for Two-Variable First-Order Logic
, 1997
"... We identify the computational complexity of the satisfiability problem for FO², the fragment of first-order logic consisting of all relational first-order sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity ..."
Abstract
-
Cited by 83 (1 self)
- Add to MetaCart
We identify the computational complexity of the satisfiability problem for FO², the fragment of first-order logic consisting of all relational first-order sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity
Finite model finding in SMT
"... Abstract. SMT solvers have been used successfully as reasoning engines for au-tomated verification. Current techniques for dealing with quantified formulas in SMT are generally incomplete, forcing SMT solvers to report “unknown ” when they fail to prove the unsatisfiability of a formula with quantif ..."
Abstract
-
Cited by 10 (5 self)
- Add to MetaCart
approaches for finite model finding in first-order logic by not relying on the introduction of domain constants for the free sorts and by being fully integrated into the general architecture used by most SMT solvers. This integration is achieved through the addition of a novel solver for sort car
Finding Finite Herbrand Models
"... Abstract. We show that finding finite Herbrand models for a restricted class of first-order clauses is ExpTime-complete. A Herbrand model is called finite if it interprets all predicates by finite subsets of the Herbrand universe. The restricted class of clauses consists of anti-Horn clauses with mo ..."
Abstract
- Add to MetaCart
Abstract. We show that finding finite Herbrand models for a restricted class of first-order clauses is ExpTime-complete. A Herbrand model is called finite if it interprets all predicates by finite subsets of the Herbrand universe. The restricted class of clauses consists of anti-Horn clauses
A Davis-Putnam Program and its Application to Finite First-Order Model Search: Quasigroup Existence Problems
, 1994
"... This document describes the implementation and use of a Davis-Putnam procedure for the propositional satisfiability problem. It also describes code that takes statements in firstorder logic with equality and a domain size n searches for models of size n. The first-order model-searching code transfor ..."
Abstract
-
Cited by 107 (10 self)
- Add to MetaCart
This document describes the implementation and use of a Davis-Putnam procedure for the propositional satisfiability problem. It also describes code that takes statements in firstorder logic with equality and a domain size n searches for models of size n. The first-order model-searching code
On the Finite Model Property in Order-Sorted Logic
"... Abstract. The Schoenfinkel-Bernays-Ramsey class is a fragment of first-order logic with the Finite Model Property: a sentence in this class is satisfiable if and only if it is satisfied in a finite model. Since an upper bound on the size of such a model is computable from the sentence, the satisfiab ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. The Schoenfinkel-Bernays-Ramsey class is a fragment of first-order logic with the Finite Model Property: a sentence in this class is satisfiable if and only if it is satisfied in a finite model. Since an upper bound on the size of such a model is computable from the sentence
Symmetry in finite models of first order logic
"... Abstract. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heuristic to eliminate some trivial symmetries. We study in this paper a more general notion of symmetry for finite model search in first order logic. We give an efficient detection method for the more general sy ..."
Abstract
- Add to MetaCart
Abstract. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heuristic to eliminate some trivial symmetries. We study in this paper a more general notion of symmetry for finite model search in first order logic. We give an efficient detection method for the more general
Linguistics, logic and finite trees
- BULLETIN OF THE IGPL
, 1994
"... A modal logic is developed to deal with finite ordered binary trees as they are used in (computational) linguistics. A modal language is introduced with operators for the `mother of', `first daughter of' and `second daughter of' relations together with their transitive reflexive clos ..."
Abstract
-
Cited by 57 (4 self)
- Add to MetaCart
A modal logic is developed to deal with finite ordered binary trees as they are used in (computational) linguistics. A modal language is introduced with operators for the `mother of', `first daughter of' and `second daughter of' relations together with their transitive reflexive
Results 1 - 10
of
1,485
