Results 1  10
of
1,347,174
Completeness of Resolution for Definite Answers
 Journal of Logic and Computation
, 1994
"... We investigate the problem of finding a computable witness for the existential quantifier in a formula of the classical firstorder predicate logic. The Aresolution calculus based on the program derivation algorithm A of CL. Chang, R. CT. Lee and R.Waldinger is used for finding a definite substit ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
that the Aresolution calculus is complete in the following sense: if such a definite substitution exists, then the Acalculus derives a clause giving such a substitution. The result is strengthened by allowing the usage of liftable criterias R of a certain type, prohibiting the derivation
Completeness of Resolution for Definite Answers Tanel Tammet
 Journal of Logic and Computation
, 1995
"... We investigate the problem of finding a computable witness for the existential quantifier in a formula of the classical firstorder predicate logic. The Aresolution calculus based on the program derivation algorithm A of CL. Chang, R. CT. Lee and R.Waldinger is used for finding a definite substit ..."
Abstract
 Add to MetaCart
that the Aresolution calculus is complete in the following sense: if such a definite substitution exists, then the Acalculus derives a clause giving such a substitution. The result is strengthened by allowing the usage of liftable criterias R of a certain type, prohibiting the derivation
Completeness of Resolution for Definite Answers Tanel Tammet
 Journal of Logic and Computation
, 1995
"... We investigate the problem of finding a computable witness for the existential quantifier in a formula of the classical firstorder predicate logic. The Aresolution calculus based on the program derivation algorithm A of CL. Chang, R. CT. Lee and R.Waldinger is used for finding a definite subs ..."
Abstract
 Add to MetaCart
prove that the Aresolution calculus is complete in the following sense: if such a definite substitution exists, then the Acalculus derives a clause giving such a substitution. The result is strengthened by allowing the usage of liftable criterias R of a certain type, prohibiting the derivation
The lexical nature of syntactic ambiguity resolution
 Psychological Review
, 1994
"... Ambiguity resolution is a central problem in language comprehension. Lexical and syntactic ambiguities are standardly assumed to involve different types of knowledge representations and be resolved by different mechanisms. An alternative account is provided in which both types of ambiguity derive fr ..."
Abstract

Cited by 556 (23 self)
 Add to MetaCart
Ambiguity resolution is a central problem in language comprehension. Lexical and syntactic ambiguities are standardly assumed to involve different types of knowledge representations and be resolved by different mechanisms. An alternative account is provided in which both types of ambiguity derive
UCPOP: A Sound, Complete, Partial Order Planner for ADL
, 1992
"... We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional effects, universally quantified preconditions and effects, and with universally quantified goals. We prove ucpo ..."
Abstract

Cited by 491 (24 self)
 Add to MetaCart
ucpop is both sound and complete for this representation and describe a practical implementation that succeeds on all of Pednault's and McDermott's examples, including the infamous "Yale Stacking Problem" [McDermott 1991].
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new
Domain names  Implementation and Specification
 RFC883, USC/Information Sciences Institute
, 1983
"... This RFC describes the details of the domain system and protocol, and assumes that the reader is familiar with the concepts discussed in a companion RFC, "Domain Names Concepts and Facilities " [RFC1034]. The domain system is a mixture of functions and data types which are an official pr ..."
Abstract

Cited by 715 (9 self)
 Add to MetaCart
and the Internet class RR data formats (e.g., host addresses). Since the previous RFC set, several definitions have changed, so some previous definitions are obsolete. Experimental or obsolete features are clearly marked in these RFCs, and such information should be used with caution. The reader is especially
Defining Virtual Reality: Dimensions Determining Telepresence
 JOURNAL OF COMMUNICATION
, 1992
"... Virtual reality (VR) is typically defined in terms of technological hardware. This paper attempts to cast a new, variablebased definition of virtual reality that can be used to classify virtual reality in relation to other media. The defintion of virtual reality is based on concepts of "presen ..."
Abstract

Cited by 534 (0 self)
 Add to MetaCart
Virtual reality (VR) is typically defined in terms of technological hardware. This paper attempts to cast a new, variablebased definition of virtual reality that can be used to classify virtual reality in relation to other media. The defintion of virtual reality is based on concepts of "
Results 1  10
of
1,347,174