Results 1  10
of
954
Mathematics of Distances and Applications 153 DISTANCE BETWEEN OBJECTS DESCRIBED BY PREDICATE FORMULAS
"... Abstract: Functions defining a distance and a distinguish degree between objects described by predicate formulas are introduced. It is proved that the introduced function of distance satisfies all properties of a distance. The function of objects distinguish degree adequately reflects similarity of ..."
Abstract
 Add to MetaCart
Abstract: Functions defining a distance and a distinguish degree between objects described by predicate formulas are introduced. It is proved that the introduced function of distance satisfies all properties of a distance. The function of objects distinguish degree adequately reflects similarity
Applications Of Circumscription To Formalizing Common Sense Knowledge
 Artificial Intelligence
, 1986
"... We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects o ..."
Abstract

Cited by 532 (12 self)
 Add to MetaCart
of various entities. Included are nonmonotonic treatments of isa hierarchies, the unique names hypothesis, and the frame problem. The new circumscription may be called formula circumscription to distinguish it from the previously defined domain circumscription and predicate circumscription. A still more
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved
Modal Languages And Bounded Fragments Of Predicate Logic
, 1996
"... Model Theory. These are nonempty families I of partial isomorphisms between models M and N , closed under taking restrictions to smaller domains, and satisfying the usual BackandForth properties for extension with objects on either side  restricted to apply only to partial isomorphisms of size ..."
Abstract

Cited by 273 (12 self)
 Add to MetaCart
at most k . 'Invariance for kpartial isomorphism' means having the same truth value at tuples of objects in any two models that are connected by a partial isomorphism in such a set. The precise sense of this is spelt out in the following proof. 21 Proof (Outline.) kvariable formulas
Consistent Detection of Global Predicates
 In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging
, 1991
"... A fundamental problem in debugging and monitoring is detecting whether the state of a system satisfies some predicate. If the system is distributed, then the resulting uncertainty in the state of the system makes such detection, in general, illdefined. This paper presents three algorithms for detec ..."
Abstract

Cited by 165 (3 self)
 Add to MetaCart
/definitely/currently interpretation such a predicate becomes welldefined, without requiring it to be recast using temporal formulas. Further, our algorithms may be more efficient than techniques that use a notion of explicit time or process histories. Section 1 specifies the protocols and Section 2 gives an outline of
Experience with Predicate Abstraction
 IN COMPUTER AIDED VERIFICATION
, 1999
"... This reports some experiences with a recentlyimplemented prototype system for verification using predicate abstraction, based on the method of Graf and Saidi [9]. Systems are described using a language of iterated guarded commands, called MurOE \Gamma\Gamma (since it is a simplified version o ..."
Abstract

Cited by 143 (6 self)
 Add to MetaCart
This reports some experiences with a recentlyimplemented prototype system for verification using predicate abstraction, based on the method of Graf and Saidi [9]. Systems are described using a language of iterated guarded commands, called MurOE \Gamma\Gamma (since it is a simplified version
On the Relative Expressiveness of Description Logics and Predicate Logics
 ARTIFICIAL INTELLIGENCE JOURNAL
, 1996
"... It is natural to view concept and role definitions in Description Logics as expressing monadic and dyadic predicates in Predicate Calculus. We show that the descriptions built using the constructors usually considered in the DL literature are characterized exactly as the predicates definable by form ..."
Abstract

Cited by 175 (3 self)
 Add to MetaCart
by formulas in ¨L³, the subset of First Order Predicate Calculus with monadic and dyadic predicates which allows only three variable symbols. In order to handle “number bounds”, we allow numeric quantifiers, and for transitive closure of roles we use infinitary disjunction. Using previous results
Predicate Abstraction with Indexed Predicates
, 2007
"... Predicate abstraction provides a powerful tool for verifying properties of infinitestate systems using a combination of a decision procedure for a subset of firstorder logic and symbolic methods originally developed for finitestate model checking. We consider models containing firstorder state v ..."
Abstract

Cited by 31 (1 self)
 Add to MetaCart
variables, where the system state includes mutable functions and predicates. Such a model can describe systems containing arbitrarily large memories, buffers, and arrays of identical processes. We describe a form of predicate abstraction that constructs a formula over a set of universally quantified
Predicates or formulas? Evidence from ellipsis
 In Proceedings of SALT VII
, 1997
"... When we begin to construct a theory of semantic interpretation and the syntaxsemantics interface, we need to make a number of fundamental decisions that have no obvious empirical justification. Consider the following three questions, for each of which there are at least two answers. First, what is ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
is the semantic type of VPs? One answer is that VPs are 1place predicates. An alternative answer is that VPs are formulas.1 For example, the LFrepresentation for John left on the "predicates " hypothesis may be (1). (1) [S John [VP left]] On the "formulas " hypothesis, the same sentence has
Results 1  10
of
954