175 search results - page 10 / 35 » Generalizing stable semantics by preferences |
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. An ordered logic program is an extended...
PODS
1990
ACM
13 years 11 months ago
1990
ACM
Previous researchers have proposed generalizations of Horn clause logic to support negation and nondeterminism as two separate extensions. In this paper, we show that the stable m...
LPNMR
2001
Springer
13 years 12 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...