Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
59,622
Extending and Implementing the Stable Model Semantics
, 2002
"... A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities ..."
Abstract
-
Cited by 396 (9 self)
- Add to MetaCart
capabilities. A declarative semantics is developed which extends the stable model semantics of normal programs. The computational complexity of the language is shown to be similar to that of normal programs under the stable model semantics. A simple embedding of general weight constraint rules to a small
The Stable Model Semantics For Logic Programming
, 1988
"... We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified. ..."
Abstract
-
Cited by 1847 (63 self)
- Add to MetaCart
We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified.
An epistemic foundation of stable model semantics
, 2003
"... The stable model semantics has become a dominating approach for the management of negation in logic programming. It relies mainly on the closed world assumption to complete the available knowledge and its formulation has its founding root in the so-called Gelfond-Lifschitz transform. The primary goa ..."
Abstract
-
Cited by 13 (3 self)
- Add to MetaCart
The stable model semantics has become a dominating approach for the management of negation in logic programming. It relies mainly on the closed world assumption to complete the available knowledge and its formulation has its founding root in the so-called Gelfond-Lifschitz transform. The primary
Asserting Lemmas in the Stable Model Semantics
"... Non–monotonic reasoning, semantics and foundations, stable model semantics From a logic programming point of view, the stable model semantics for normal programs has the problem that logical consequences of programs cannot, in general, be stored as lemmas. This is because the set of stable models of ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Non–monotonic reasoning, semantics and foundations, stable model semantics From a logic programming point of view, the stable model semantics for normal programs has the problem that logical consequences of programs cannot, in general, be stored as lemmas. This is because the set of stable models
Efficient Implementation of the Well-founded and Stable Model Semantics
- Proceedings of the Joint International Conference and Symposium on Logic Programming
, 1996
"... An implementation of the well-founded and stable model semantics for range-restricted function-free normal programs is presented. It includes two modules: an algorithm for implementing the two semantics for ground programs and an algorithm for computing a grounded version of a range-restricted funct ..."
Abstract
-
Cited by 142 (15 self)
- Add to MetaCart
An implementation of the well-founded and stable model semantics for range-restricted function-free normal programs is presented. It includes two modules: an algorithm for implementing the two semantics for ground programs and an algorithm for computing a grounded version of a range
On the Stable Model Semantics for Intensional Functions
- UNDER CONSIDERATION FOR PUBLICATION IN THEORY AND PRACTICE OF LOGIC PROGRAMMING
, 2013
"... Several extensions of the stable model semantics are available to describe “intensional” functions—functions that can be described in terms of other functions and predicates by logic programs. Such functions are useful for expressing inertia and default behaviors of systems, and can be exploited for ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
Several extensions of the stable model semantics are available to describe “intensional” functions—functions that can be described in terms of other functions and predicates by logic programs. Such functions are useful for expressing inertia and default behaviors of systems, and can be exploited
Approximating the Stable Model Semantics is Hard
, 1996
"... In this paper we investigate the complexity of problems concerned with approximating the stable model semantics. We show that under rather weak assumptions it is NP-hard to decide whether the size of a polynomially computable approximation is within a constant factor from the size of the intersectio ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
In this paper we investigate the complexity of problems concerned with approximating the stable model semantics. We show that under rather weak assumptions it is NP-hard to decide whether the size of a polynomially computable approximation is within a constant factor from the size
Extending the stable model semantics with more expressive roles
- In 5th International Conference, LPNMR "99
, 1999
"... The rules associated with propositional logic programs and the stable model semantics are not expressive enough to let one write concise programs. This problem is alleviated by introducing some new types of propositional rules. Together with a decision procedure that has been used as a base for an e ..."
Abstract
-
Cited by 40 (4 self)
- Add to MetaCart
The rules associated with propositional logic programs and the stable model semantics are not expressive enough to let one write concise programs. This problem is alleviated by introducing some new types of propositional rules. Together with a decision procedure that has been used as a base
Stable Model Semantics of Weight Constraint Rules
- PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR’99), VOLUME 1730 OF LECTURE
, 1999
"... A generalization of logic program rules is proposed where rules are built from weight constraints with type information for each predicate instead of simple literals. These kinds of constraints are useful for concisely representing different kinds of choices as well as cardinality, cost and resource ..."
Abstract
-
Cited by 61 (7 self)
- Add to MetaCart
and resource constraints in combinatorial problems such as product configuration. A declarative semantics for the rules is presented which generalizes the stable model semantics of normal logic programs. It is shown that for ground rules the complexity of the relevant decision problems stays in NP. The fust
Results 1 - 10
of
59,622
