The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

## Filters

##
###
Preferred Answer Sets for Ordered Logic Programs
[article]

2004
*
arXiv
*
pre-print

We show that such a rule

arXiv:cs/0407049v1
fatcat:amplkrtxs5ck3jqx7veo67sqfe
*order*induces a natural*order*on extended*answer**sets*, the minimal elements of which we call*preferred**answer**sets*. ... Within the context of inconsistent*programs*, it is natural to have a partial*order*on rules, representing a*preference**for*satisfying certain rules, possibly at the cost of violating less important ones ... Adding inapplicable rules w.r.t. a*preferred**answer**set*to an*ordered**logic**program*does not change anything to its*preferredness*. ...##
###
Preferred answer sets for ordered logic programs

2006
*
Theory and Practice of Logic Programming
*

We show that such a rule

doi:10.1017/s1471068404002315
fatcat:35lzz6can5e3pa3v7rxtjrrmcm
*order*induces a natural*order*on extended*answer**sets*, the minimal elements of which we call*preferred**answer**sets*. ... Within the context of inconsistent*programs*, it is natural to have a partial*order*on rules, representing a*preference**for*satisfying certain rules, possibly at the cost of violating less important ones ...*Preferred**answer**sets**for**ordered**programs*correspond to minimal reducts in the ¥ -partial*order*that is induced by the rule*preference**order*. ...##
###
Preferred Answer Sets for Ordered Logic Programs
[chapter]

2002
*
Lecture Notes in Computer Science
*

We show that such a rule

doi:10.1007/3-540-45757-7_36
fatcat:z34yqiihr5h4hmawclmdklnnxe
*order*induces a natural*order*on extended*answer**sets*, the minimal elements of which we call*preferred**answer**sets*. ... Within the context of inconsistent*programs*, it is natural to have a partial*order*on rules, representing a*preference**for*satisfying certain rules, possibly at the cost of violating less important ones ...*Preferred**answer**sets**for**ordered**programs*correspond to minimal reducts in the ¥ -partial*order*that is induced by the rule*preference**order*. ...##
###
Logic Programs with Compiled Preferences
[article]

2000
*
arXiv
*
pre-print

We describe an approach

arXiv:cs/0003028v1
fatcat:7hr6rwfwofg5hfau3esyy3ixum
*for*compiling*preferences*into*logic**programs*under the*answer**set*semantics. ... An*ordered**logic**program*is transformed into a second, regular, extended*logic**program*wherein the*preferences*are respected, in that the*answer**sets*obtained in the transformed theory correspond with ... X is a*preferred**answer**set*of*ordered**logic**program*Π; 3. X is a regular*answer**set*of*logic**program*Π. ...##
###
A Compiler for Ordered Logic Programs
[article]

2000
*
arXiv
*
pre-print

This paper describes a system, called PLP,

arXiv:cs/0003024v1
fatcat:lsebf4il7zgulb7rxeat7wawna
*for*compiling*ordered**logic**programs*into standard*logic**programs*under the*answer**set*semantics. ... An*ordered**logic**program*is transformed into a second, regular, extended*logic**program*wherein the*preferences*are respected, in that the*answer**sets*obtained in the transformed theory correspond with ...*for**ordered**logic**programs*. ...##
###
A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning

2004
*
Computational intelligence
*

Here, we present an overview and classification

doi:10.1111/j.0824-7935.2004.00240.x
fatcat:2athvzwyazgobgqki57falevsi
*for*approaches to dealing with*preference*. ... A*set*of criteria*for*classifying approaches is given, followed by a*set*of desiderata that an approach might be expected to satisfy. ... Acknowledgements The authors would like to thank the anonymous referees*for*valuable com- ...##
###
Translating Preferred Answer Set Programs to Propositional Logic
[chapter]

2009
*
Lecture Notes in Computer Science
*

may also lead to efficient implementations

doi:10.1007/978-3-642-04238-6_33
fatcat:h66cycoskrhatdzchkvziwltzi
*for*computing*preferred**answer**sets*of*logic**programs*. ... We propose a translation from*preferred**answer**set**programs*to propositional*logic*and show that there is one-to-one correspondence between the*preferred**answer**sets*of the*program*to the models of the ...*For*a fully prioritized grounded*logic**program*Π < = (Π, <) and an*answer**set*A of Π, A is a*preferred**answer**set*of Π < if and only if C A Π < ′ (A) = A. ...##
###
Order and Negation as Failure
[chapter]

2003
*
Lecture Notes in Computer Science
*

We equip

doi:10.1007/978-3-540-24599-5_14
fatcat:uu5d7y3jp5afxj3bntapkxa7t4
*ordered**logic**programs*with negation as failure, using a simple generalization of the*preferred**answer**set*semantics*for**ordered**programs*. ... The simulation also supports a broader application of "*ordered*disjunction", handling problems that would be cumbersome to express using*ordered*disjunction*logic**programs*. ...*Preferred**answer**sets**for**programs*with*ordered*disjunction need not be subset minimal. ...##
###
Pstable Semantics for Logic Programs with Possibilistic Ordered Disjunction
[chapter]

2009
*
Lecture Notes in Computer Science
*

We compare the possibilistic pstable semantics

doi:10.1007/978-3-642-10291-2_6
fatcat:2ajr2kyxtjb4pebwyrqitngyry
*for**ordered*disjunction*programs*with the recently defined possibilistic*answer**set*semantics*for*the same class of*logic**programs*. ... In this paper we define the semantics*for*capturing possibilistic*ordered*disjunction*programs*based on pstable semantics. ... Javier Vázquez-Salceda is partially supported by the Ramón y Cajal*program*of the Spanish Ministry of Education and Science. We are grateful to anonymous referees*for*their useful comments. ...##
###
Possibilistic Semantics for Logic Programs with Ordered Disjunction
[chapter]

2010
*
Lecture Notes in Computer Science
*

In this paper we define a class of nested

doi:10.1007/978-3-642-11829-6_11
fatcat:tpqstzzeibciricj3r2c666xfm
*logic**programs*, nested*logic**programs*with*ordered*disjunction (LP ODs + ), which allows to specify qualitative*preferences*by means of nested*preference*expressions ...*For*doing this we extend the syntax of*logic**programs*with*ordered*disjunction (LPODs) to capture more general expressions. ... Acknowledgements The authors would like to thank the anonymous referees*for*their useful suggestions and comments. This research has been partially supported by ICT-ALIVE (FP7-215890). ...##
###
Preferences and Nonmonotonic Reasoning

2008
*
The AI Magazine
*

Selecting extended

doi:10.1609/aimag.v29i4.2179
fatcat:2qrcipfj3fd3lirr24go6smm5m
*logic**programming*with the*answer*-*set*semantics as a "generic" nonmonotonic*logic*, we show how that*logic*defines*preferred*belief*sets*and how*preferred*belief*sets*allow us to represent ... Conflicts among*program*rules (more generally, defaults) give rise to alternative*preferred*belief*sets*. ... Acknowledgments We thank the reviewers*for*helpful comments. Ilkka Niemelä acknowledges the support of Academy of Finland grant 122399. ...##
###
Logic Programming with Ordered Disjunction
[article]

2002
*
arXiv
*
pre-print

The semantics of

arXiv:cs/0207042v1
fatcat:pvjd4z6zjbe6xcuhc5zqhxtlwa
*logic**programs*with*ordered*disjunction is based on a*preference*relation on*answer**sets*. ...*Logic**programs*with*ordered*disjunction (LPODs) combine ideas underlying Qualitative Choice*Logic*(Brewka et al. KR 2002) and*answer**set**programming*. ... Acknowledgements I would like to thank Salem Benferhat, Richard Booth, Tomi Janhunen, Ilkka Niemelä, Tommi Syrjänen and Leon van der Torre*for*helpful comments. ...##
###
Preferred well-founded semantics for logic programming by alternating fixpoints: Preliminary report
[article]

2002
*
arXiv
*
pre-print

We then specify some informal yet intuitive criteria and propose a semantical framework

arXiv:cs/0207060v1
fatcat:rjrtsi5uhrgebnstaom7bezrgi
*for**preference*handling that is more suitable*for*defining well-founded semantics*for**ordered**logic**programs*. ... We analyze the problem of defining well-founded semantics*for**ordered**logic**programs*within a general framework based on alternating fixpoint theory. ... This work was supported by DFG under grant*FOR*375/1-1, TP C. ...##
###
Page 7264 of Mathematical Reviews Vol. , Issue 2004i
[page]

2004
*
Mathematical Reviews
*

The paper develops a specific theory of the

*preferred**answer**sets*semantics that is “situated” between (and succeeds in inte- grating extended)*logic**programs*with*preferred**answer**sets*(G. ... characterized in a uniform way by their*preferred**answer**sets*. ...##
###
plp: A Generic Compiler for Ordered Logic Programs
[chapter]

2001
*
Lecture Notes in Computer Science
*

This paper describes a generic compiler, called plp,

doi:10.1007/3-540-45402-0_33
fatcat:rwkaqjpguna77l2glllohy45am
*for*translating*ordered**logic**programs*into standard*logic**programs*under the*answer**set*semantics. ... An*ordered**logic**program*is transformed into a second, regular, extended*logic**program*wherein the*preferences*are respected, in that the*answer**sets*obtained in the transformed theory correspond with ... first author received partial support from the Natural Sciences and Engineering Research Council of Canada; the second author was partially supported by the German Science Foundation (DFG) under grant*FOR*...
« Previous

*Showing results 1 — 15 out of 216,272 results*