B. Dreben and W.D. Goldfarb. The decision problem. Solvable classes of quantificational formulas. Addison Wesley, 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Solvable set/hyperset contexts: I. Some decision procedures.. - Omodeo, Policriti (Correct)
....problem for 9 8 sentences in varied theories of sets. At first, one may find non surprising the conclusion that this problem is algorithmically solvable, in view of the low syntactic complexity of the sentences under study; however, when one comes to consider the quantificational complexity (cf. [DG79]) hidden in the axioms of the theory, which is at best 9 z 8 u 8 y 9 w 8 v, one realizes that this decidability result ensues from certain felicitous peculiarities shared by all sensible set theories. This result, mainly 2 when referred to very weak theories of sets, sheds some light upon the ....
B. Dreben and W. D. Goldfarb. The Decision Problem. Solvable classes of quantificational formulas. Addison-Wesley, 1979.
Combining inference and disinference rules with enumeration.. - Caferra, Peltier (1997) (Correct)
....application of BuildMod 1 returns an eqmodel of S. Remark. There exist several interesting classes of formulae with the property that any satisfiable set of c clauses in these classes have an eq model. This is the case for example for the classes Pvd, Occ1N [13] the Bernay Schonfinkel class [11] and more generally any class decidable by hyperresolution without subsumption (see [12, 5, 13] Our method can build models for any satisfiable formula in these classes. Remark. Several strategies can be defined (similar to the order in which the rules are applied by the Davis and Putnam ....
B. Dreben and W. D. Goldfarb. The Decision Problem, Solvable Classes of Quantificational Formulas. Addison-Wesley, 1979.
Ezy Mnogo'sciowe W Pewnych Teoriach R'owno'sciowych - Witold Charatonik (Correct)
....used. The problem with unrestricted diagonalizations in (more general than positive) negative set constraints was solved by Charatonik and Pacholski in [11] We used there the following extension of the lemma 3.25 (the definition of the relation j is given just before lemma 3.25) Lemma 1. 2 (see [16]) A monadic formula with equality, of quantifier depth at most k, is satisfiable if and only if it has a finite model (of cardinality M 2 N k) such that in each equivalence class of the relation j there are at most k elements. Definition 1.3. Let be a monadic formula with equality, of ....
B. Dreben and W. D. Goldfarb. The Decision Problem. Solvable Classes of Quantificational Formulas. Addison-Wesley Publishing Company, Inc., 1979.
Model Building and Interactive Theory Discovery - Caferra, Peltier (1995) (7 citations) (Correct)
....have a peq model in a theory T . The idea is to add equational hypothesis, permitting to build the model. We show in this section that our method provides an substantial help in the discovery of the theory T . This interesting feature of RAMC is well illustrated by the example below, taken from [DG79, page 205]. It is a formula in three solvable 898 classes with identity. These classes are not finitely controllable but they are docile 4 . This formula is satisfiable only over infinite universes and universes of even cardinality. We consider that it is worth investigating this kind of formulae with the ....
....f(f(y) 4 A class is finitely controllable if every satisfiable formula in the class has a finite model. It is docile if there is an effective method for deciding if a formula in the class has a finite model. 5 We do not have much information about the spectra of schemata in these classes [DG79, page 205]. 6 The extension of the constraints language given in [PEL95] allows to build and to express these models [PEL95] We keep here this limit in order to illustrate theory discovering on a simple example. The idea is to introduce set of equations (i.e. a theory T ) in order to force constraints ....
Burton DREBEN and Warren D. GOLDFARB. The Decision Problem, Solvable Classes of Quantificational Formulas. Addison-Wesley, 1979.
Decision Procedures using Model Building techniques - Caferra, Peltier (1996) (14 citations) (Correct)
.... study of decidable classes a key technique is to show the existence of bounds (say n 2 N) such that it is sufficient to expand a formula schema up to a maximum of n Herbrand instances and then test this finite expansion for (in)consistency to decide the validity of the formula (see for example [DG79, B OR84, LEW79] A characteristic of this technique is that there is practically no uniform treatment of the different classes (for each class the bound n must be found in an ad hoc manner) A first unified approach to treat decidable class to the best of our knowledge was the one by the ....
Burton DREBEN and Warren D. GOLDFARB. The Decision Problem, Solvable Classes of Quantificational Formulas. Addison-Wesley, 1979.
Negative Set Constraints With Equality - Charatonik, Pacholski (1994) (30 citations) (Correct)
....with equality. Two interpretations I; J of are similar if for each pair c I ; c J of corresponding equivalence classes of the relations j I and j J either jc I j = jc J j or both c I and c J have at least q elements. As an immediate application of Ehrenfeucht games [10] one can prove (see also [9]) that if I is a model of and I is similar to J , then J is also a model of . If has no positive occurrences of the equality predicate, the similarity condition can be weakened: for J to be a model of it suffices that for each pair of corresponding equivalence classes we have jc I j jc ....
B. Dreben and W. D. Goldfarb. The Decision Problem. Solvable Classes of Quantificational Formulas. Addison-Wesley Publishing Company, Inc., 1979.
Tractable Reasoning via Approximation - Schaerf, Cadoli (1995) (37 citations) (Correct)
....lead to intractable reasoning problems. Such constructors are dealt with incomplete inference algorithms grounded on non standard semantics. For what concerns the language restriction approach, fundamental studies on the complexity of fragments of classical propositional [65] and first order logic [28] have been done in the last decades. More recently, computational studies about several logical formalisms relevant for KR appeared. Studies analyzing the so called tractability threshold between polynomially tractable and intractable languages are of particular practical interest. Among the most ....
B. Dreben and W. D. Goldfarb. The decision problem. Solvable classes of quantificational formulas. Addison-Wesley, 1979.
Unknown - (Correct)
No context found.
B. Dreben and W.D. Goldfarb. The decision problem. Solvable classes of quantificational formulas. Addison Wesley, 1979.
Compact Propositionalizations of First-Order Theories - Ramachandran, Amir (Correct)
No context found.
Burton Dreben and Warren D. Goldfarb, The decision problem; solvable classes of quantificational formulas, Addison-Wesley, 1979.
Data Integration under the Schema Tuple Query Assumption - Hedlund (2003) (Correct)
No context found.
B. Dreben and W.D. Goldfarb. The decision problem. Solvable classes of quantificational formulas. Addison Wesley, 1979.
Resolution Decides the Guarded Fragment - de Nivelle (1998) (1 citation) (Correct)
No context found.
B. Dreben, W.D. Goldfarb, The Decision Problem, Solvable Classes of Quantificational Formulas, Addision-Wesley Publishing Company, Inc. 1979.
Deciding the E + -class by an a posteriori, liftable order - de Nivelle (1998) (Correct)
No context found.
B. Dreben, W.D. Goldfarb, The Decision Problem, Solvable Classes of Quantificational Formulas, Addision-Wesley Publishing Company, Inc. 1979.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC