Results 1  10
of
1,973
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
The Acquisition of Linguistic Competence for Communicating Propositional Logic Sentences
"... Abstract. We describe some experiments which show how a language expressive enough to allow the communication of meanings of the same complexity as propositional logic formulas can emerge in a population of autonomous agents which have no prior linguistic knowledge. We take an approach based on gene ..."
Abstract
 Add to MetaCart
of grammar rules. In particular the agents are allowed to order the expressions associated with the constituents of a logical formula in arbitrary order in the sentence. Previous work assumed that the expressions associated with the connectives should be always placed in the first position of the sentence
A TemplateBased Approach Toward Acquisition of Logical Sentences
 In Procs.Intelligent Information Processing 2002  World Computer Congress
, 2002
"... Ontologydevelopment languages may allow users to supplement framebased representations with arbitrary logical sentences. In the case of the Ontolingua ontology library, only 10% of the ontologies have any userdefined axioms. We believe the phrase "writing axioms is difficult" accounts f ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Ontologydevelopment languages may allow users to supplement framebased representations with arbitrary logical sentences. In the case of the Ontolingua ontology library, only 10% of the ontologies have any userdefined axioms. We believe the phrase "writing axioms is difficult" accounts
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
Learning to Map Sentences to Logical Form: Structured Classification with Probabilistic Categorial Grammars
 In Proceedings of the 21st Conference on Uncertainty in AI
, 2005
"... This paper addresses the problem of mapping natural language sentences to lambda–calculus encodings of their meaning. We describe a learning algorithm that takes as input a training set of sentences labeled with expressions in the lambda calculus. The algorithm induces a grammar for the problem, alo ..."
Abstract

Cited by 157 (14 self)
 Add to MetaCart
This paper addresses the problem of mapping natural language sentences to lambda–calculus encodings of their meaning. We describe a learning algorithm that takes as input a training set of sentences labeled with expressions in the lambda calculus. The algorithm induces a grammar for the problem
Languages That Capture Complexity Classes
 SIAM Journal of Computing
, 1987
"... this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a property of graphs (respectively groups, binary strings, etc.) is in polynomial time if and only if it is expressible in the first ..."
Abstract

Cited by 245 (21 self)
 Add to MetaCart
to complexity theory go back to 1974 when Fagin showed that the NP properties are exactly those expressible in second order existential sentences. It follows that second order logic expresses exactly those properties which are in the polynomial time hierarchy. We show that adding suitable transitive closure
Probabilities on Sentences in an Expressive Logic
, 2012
"... 1 Automated reasoning about uncertain knowledge has many applications. One difficulty when developing such systems is the lack of a completely satisfactory integration of logic and probability. We address this problem directly. Expressive languages like higherorder logic are ideally suited for repre ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
should be ascribed to other (query) sentences? A natural wishlist, among others, is that the probability distribution (i) is consistent with the knowledge base, (ii) allows for a consistent inference procedure and in particular (iii) reduces to deductive logic in the limit of probabilities being 0 and 1
The Logic and Mathematics of Occasion Sentences
"... The prime purpose of this paper is to contribute to the development of an adequate logic of occasion sentences and a mathematical (Boolean) foundation for such a logic, thus preparing the ground for a more principled and better founded semantics of occasion sentences. Some of the insights elaborated ..."
Abstract
 Add to MetaCart
The prime purpose of this paper is to contribute to the development of an adequate logic of occasion sentences and a mathematical (Boolean) foundation for such a logic, thus preparing the ground for a more principled and better founded semantics of occasion sentences. Some of the insights
ON THE LOGIC OF PERCEPTION SENTENCES
"... In this paper I discuss perception sentences of the following there syntactic types: (1) John saw Mary (perceives – direct object) (2) John saw Mary run (perceives – naked infinitive) (3) John saw that Mary run (perceives –sentential complement) Our aim is to present an interpretation of Hintikka’s ..."
Abstract
 Add to MetaCart
’s logic of perception, extend it to case (2) and defined the approach against the cirticism levelled against it by Jon Barwise. Hintikka’s semantics for perception sentences applies most straightforwardly to reports with a sentential complement. It analyses such a perception expression as a usual
Logical Relations in Chinese and the Theory of Grammar
, 1982
"... The nature of Logical Form is studied through an examination of the syntax and semantics of a range of constructions in Chinese that pertain to scope phenomena, anaphora, and the syntax of empty categories. At the descriptive level, we provide an extensive account of Chinese quantificational sente ..."
Abstract

Cited by 141 (0 self)
 Add to MetaCart
The nature of Logical Form is studied through an examination of the syntax and semantics of a range of constructions in Chinese that pertain to scope phenomena, anaphora, and the syntax of empty categories. At the descriptive level, we provide an extensive account of Chinese quantificational
Results 1  10
of
1,973