Results 1  10
of
4,695
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods
Strategies of Discourse Comprehension
, 1983
"... El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIAbacke ..."
Abstract

Cited by 601 (27 self)
 Add to MetaCart
El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIA
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 455 (100 self)
 Add to MetaCart
Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely
An algorithm for pronominal anaphora resolution
 Computational Linguistics
, 1994
"... This paper presents an algorithm for identifying the noun phrase antecedents of third person pronouns and lexical anaphors (reflexives and reciprocals). The algorithm applies to the syntactic representations generated by McCord's Slot Grammar parser, and relies on salience measures derived from ..."
Abstract

Cited by 386 (0 self)
 Add to MetaCart
from syntactic structure and a simple dynamic model of attentional state. Like the parser, the algorithm is implemented in Prolog. The authors have tested it extensively on computer manual texts, and conducted a blind test on manual text containing 360 pronoun occurrences. The algorithm successfully
Logic Programming with Focusing Proofs in Linear Logic
 Journal of Logic and Computation
, 1992
"... The deep symmetry of Linear Logic [18] makes it suitable for providing abstract models of computation, free from implementation details which are, by nature, oriented and non symmetrical. I propose here one such model, in the area of Logic Programming, where the basic computational principle is C ..."
Abstract

Cited by 416 (8 self)
 Add to MetaCart
The deep symmetry of Linear Logic [18] makes it suitable for providing abstract models of computation, free from implementation details which are, by nature, oriented and non symmetrical. I propose here one such model, in the area of Logic Programming, where the basic computational principle is Computation = Proof search.
Extraction of Proofs from the Clausal Normal Form Transformation
"... Abstract. This paper discusses the problem of how to transform a firstorder formula into clausal normal form, and to simultaneously construct a proof that the clausal normal form is correct. This is relevant for applications of automated theorem proving where people want to be able to use theorem pr ..."
Abstract
 Add to MetaCart
Abstract. This paper discusses the problem of how to transform a firstorder formula into clausal normal form, and to simultaneously construct a proof that the clausal normal form is correct. This is relevant for applications of automated theorem proving where people want to be able to use theorem
Improving Machine Learning Approaches to Coreference Resolution
, 2002
"... We present a noun phrase coreference system that extends the work of Soon et al. (2001) and, to our knowledge, produces the best results to date on the MUC6 and MUC7 coreference resolution data sets  Fmeasures of 70.4 and 63.4, respectively. ..."
Abstract

Cited by 335 (24 self)
 Add to MetaCart
We present a noun phrase coreference system that extends the work of Soon et al. (2001) and, to our knowledge, produces the best results to date on the MUC6 and MUC7 coreference resolution data sets  Fmeasures of 70.4 and 63.4, respectively.
Clausal Proofs and Discontinuity
, 1995
"... We consider the task of theorem proving in Lambek calculi and their generalisation to "multimodal residuation calculi". These form an integral part of categorial logic, a logic of signs stemming from categorial grammar, on the basis of which language processing is essentially theorem provi ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We consider the task of theorem proving in Lambek calculi and their generalisation to "multimodal residuation calculi". These form an integral part of categorial logic, a logic of signs stemming from categorial grammar, on the basis of which language processing is essentially theorem
Simplifying Clausal Satisfiability Problems
 IN CONSTRAINTS IN COMPUTATIONAL LOGIC CCL'94, MUNICH
, 1994
"... Recently linear 01 programming methods have been successfully applied to the satisfiability problem of propositional logic. We present a preprocessing method that simplifies the linear 01 integer problem corresponding to a clausal satisfiability problem. Valid extended clauses, a generalizatio ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Recently linear 01 programming methods have been successfully applied to the satisfiability problem of propositional logic. We present a preprocessing method that simplifies the linear 01 integer problem corresponding to a clausal satisfiability problem. Valid extended clauses, a
Results 1  10
of
4,695