Results 1  10
of
1,348
Knowledge Interchange Format Version 3.0 Reference Manual
, 1992
"... : Knowledge Interchange Format (KIF) is a computeroriented language for the interchange of knowledge among disparate programs. It has declarative semantics (i.e. the meaning of expressions in the representation can be understood without appeal to an interpreter for manipulating those expressions); ..."
Abstract

Cited by 484 (14 self)
 Add to MetaCart
); it is logically comprehensive (i.e. it provides for the expression of arbitrary sentences in the firstorder predicate calculus); it provides for the representation of knowledge about the representation of knowledge; it provides for the representation of nonmonotonic reasoning rules; and it provides
The Semantics of Predicate Logic as a Programming Language
 JOURNAL OF THE ACM
, 1976
"... Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational seman ..."
Abstract

Cited by 808 (18 self)
 Add to MetaCart
Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational
Grounding language in action
 Psychonomic Bulletin & Review
, 2002
"... We report a new phenomenon associated with language comprehension: the action–sentence compatibility effect (ACE). Participants judged whether sentences were sensible by making a response that required moving toward or away from their bodies. When a sentence implied action in one direction (e.g., “C ..."
Abstract

Cited by 353 (16 self)
 Add to MetaCart
of sentences to human action. How language conveys meaning remains an open question. The dominant approach is to treat language as a symbol manipulation system: Language conveys meaning by using abstract, amodal, and arbitrary symbols (i.e., words) combined by syntactic rules (e.g., Burgess & Lund, 1997
Discriminative Reranking for Natural Language Parsing
, 2005
"... This article considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses. A second model then attempts to improve upon this i ..."
Abstract

Cited by 333 (9 self)
 Add to MetaCart
This article considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses. A second model then attempts to improve upon
HiLog: A foundation for higherorder logic programming
 JOURNAL OF LOGIC PROGRAMMING
, 1993
"... We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic programming than does traditional predicate logic. HiLog has a higherorder syntax and allows arbitrary terms to appear in places where predicates, functions and atomic formulas occur in predicate calc ..."
Abstract

Cited by 252 (42 self)
 Add to MetaCart
We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic programming than does traditional predicate logic. HiLog has a higherorder syntax and allows arbitrary terms to appear in places where predicates, functions and atomic formulas occur in predicate
Symmetric splitting in the general theory of stable models
, 2010
"... Splitting a logic program allows us to reduce the task of computing its stable models to similar tasks for smaller programs. This idea is extended here to the general theory of stable models that replaces traditional logic programs by arbitrary firstorder sentences and distinguishes between intensio ..."
Abstract

Cited by 26 (15 self)
 Add to MetaCart
Splitting a logic program allows us to reduce the task of computing its stable models to similar tasks for smaller programs. This idea is extended here to the general theory of stable models that replaces traditional logic programs by arbitrary firstorder sentences and distinguishes between
Linear Time Computable Problems and FirstOrder Descriptions
, 1996
"... this article is a proof that each FO problem can be solved in linear time if only relational structures of bounded degree are considered. The basic idea of the proof is a localization technique based on a method that was originally developed by Hanf (Hanf 1965) to show that the elementary theories o ..."
Abstract

Cited by 45 (1 self)
 Add to MetaCart
of two structures are equal under certain conditions, i.e., that two structures agree on all firstorder sentences. Fagin, Stockmeyer and Vardi (Fagin et al. 1993) developed a variant of this technique, which is applicable in descriptive complexity theory to classes of finite relational structures
On stress and linguistic rhythm
 Linguistic Inquiry
, 1977
"... In this essay a new theory of stress and linguistic rhythm will be elaborated, based on the proposals of Liberman (1975). ' It will be argued that certain features of prosodic systems like that of English, in particular the phenomenon of "stress subordination", are not to be referred ..."
Abstract

Cited by 213 (7 self)
 Add to MetaCart
primarily to the properties of individual segments (or syllables), but rather reflect a hierarchical rhythmic structuring that organizes the syllables, words, and syntactic phrases of a sentence. The character of this structuring, properly understood, will give fresh insight into phenomena that have been
Firstorder queries on finite structures over the reals
"... We investigate properties of finite relational structures over the reals expressed by firstorder sentences whose predicates are the relations of the structure plus arbitrary polynomial inequalities, and whose quantifiers can range over the whole set of reals. In constraint programming terminology, ..."
Abstract

Cited by 32 (2 self)
 Add to MetaCart
We investigate properties of finite relational structures over the reals expressed by firstorder sentences whose predicates are the relations of the structure plus arbitrary polynomial inequalities, and whose quantifiers can range over the whole set of reals. In constraint programming terminology
Building specifications in an arbitrary institution
 Proc. Int. Symposium on Semantics of Data Types, LNCS 173
, 1984
"... A set of operations for constructing algebraic specifications in an arbitrary logical system is presented. This builds on the framework provided by Goguen and Burstall's work on the notion of an institution as a formalisation of the concept of a logical system for writing specifications. We sho ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
show how to introduce free variables into the sentences of an arbitrary institution and how to add quantifiers which bind them. We use this foundation to define a set of primitive operations for building specifications in an arbitrary institution based loosely on those in the ASL kernel specification
Results 1  10
of
1,348