Results 1  10
of
511,276
On computing backbones of propositional theories
 In ECAI
, 2010
"... Abstract. Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreover, backbones find other applications. For example, backbones are often identified during product configura ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreover, backbones find other applications. For example, backbones are often identified during product
Answer Sets for Propositional Theories
 In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR
, 2005
"... Abstract. Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case in which every formula is a “rule ” — an implication that has no implications in the antecedent (body) and c ..."
Abstract

Cited by 91 (9 self)
 Add to MetaCart
Abstract. Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case in which every formula is a “rule ” — an implication that has no implications in the antecedent (body) and consequent (head). The semantics of equilibrium logic looks very different from the usual definitions of an answer set in logic programming, as it is based on Kripke models. In this paper we propose a new definition of equilibrium logic which uses the concept of a reduct, as in the standard definition of an answer set. Second, we apply the generalized concept of an answer set to the problem of defining the semantics of aggregates in answer set programming. We propose, in particular, a semantics for weight constraints that covers the problematic case of negative weights. Our semantics of aggregates is an extension of the approach due to Faber, Leone, and Pfeifer to a language with choice rules and, more generally, arbitrary rules with nested expressions. 1
The Proposition Bank: An Annotated Corpus of Semantic Roles
 Computational Linguistics
, 2005
"... The Proposition Bank project takes a practical approach to semantic representation, adding a layer of predicateargument information, or semantic role labels, to the syntactic structures of the Penn Treebank. The resulting resource can be thought of as shallow, in that it does not represent corefere ..."
Abstract

Cited by 536 (21 self)
 Add to MetaCart
The Proposition Bank project takes a practical approach to semantic representation, adding a layer of predicateargument information, or semantic role labels, to the syntactic structures of the Penn Treebank. The resulting resource can be thought of as shallow, in that it does not represent
Propositional Theories are Strongly Equivalent to Logic Programs
 UNDER CONSIDERATION FOR PUBLICATION IN THEORY AND PRACTICE OF LOGIC PROGRAMMING
, 2003
"... In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be reexpressed as a strongly equivalent disjunctive logic program, possibly with negation in the head. We provide two differen ..."
Abstract

Cited by 28 (7 self)
 Add to MetaCart
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be reexpressed as a strongly equivalent disjunctive logic program, possibly with negation in the head. We provide two
Reducing propositional theories in equilibrium logic to logic programs
 PROGRESS IN ARTIFICIAL INTELLIGENCE, PROC. OF THE 12TH PORTUGUESE CONF. ON ARTIFICIAL INTELLIGENCE, EPIA’05
, 2005
"... The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to transform an arbitrary set of propositional formulas into an equivalent logic program and what are the complexity const ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to transform an arbitrary set of propositional formulas into an equivalent logic program and what are the complexity
A theory of human motivation
 Psychological Review
, 1943
"... In a previous paper (13) various propositions were presented which would have to be included in any theory of human motivation that could lay claim to being definitive. These conclusions may be briefly summarized as follows: 1. The integrated wholeness of the organism must be one of the foundation ..."
Abstract

Cited by 1131 (0 self)
 Add to MetaCart
In a previous paper (13) various propositions were presented which would have to be included in any theory of human motivation that could lay claim to being definitive. These conclusions may be briefly summarized as follows: 1. The integrated wholeness of the organism must be one of the foundation
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.
A theory of memory retrieval
 PSYCHOL. REV
, 1978
"... A theory of memory retrieval is developed and is shown to apply over a range of experimental paradigms. Access to memory traces is viewed in terms of a resonance metaphor. The probe item evokes the search set on the basis of probememory item relatedness, just as a ringing tuning fork evokes sympath ..."
Abstract

Cited by 728 (81 self)
 Add to MetaCart
A theory of memory retrieval is developed and is shown to apply over a range of experimental paradigms. Access to memory traces is viewed in terms of a resonance metaphor. The probe item evokes the search set on the basis of probememory item relatedness, just as a ringing tuning fork evokes
Results 1  10
of
511,276