Filters








216,272 Hits in 3.9 sec

Preferred Answer Sets for Ordered Logic Programs [article]

Davy Van Nieuwenborgh, Dirk Vermeir
2004 arXiv   pre-print
We show that such a rule 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.  ... 
arXiv:cs/0407049v1 fatcat:amplkrtxs5ck3jqx7veo67sqfe

Preferred answer sets for ordered logic programs

DAVY VAN NIEUWENBORGH, DIRK VERMEIR
2006 Theory and Practice of Logic Programming  
We show that such a rule 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.  ... 
doi:10.1017/s1471068404002315 fatcat:35lzz6can5e3pa3v7rxtjrrmcm

Preferred Answer Sets for Ordered Logic Programs [chapter]

Davy Van Nieuwenborgh, Dirk Vermeir
2002 Lecture Notes in Computer Science  
We show that such a rule 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.  ... 
doi:10.1007/3-540-45757-7_36 fatcat:z34yqiihr5h4hmawclmdklnnxe

Logic Programs with Compiled Preferences [article]

James P. Delgrande, Torsten Schaub, Hans Tompits
2000 arXiv   pre-print
We describe an approach 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 Π.  ... 
arXiv:cs/0003028v1 fatcat:7hr6rwfwofg5hfau3esyy3ixum

A Compiler for Ordered Logic Programs [article]

James P. Delgrande, Torsten Schaub, Hans Tompits
2000 arXiv   pre-print
This paper describes a system, called PLP, 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.  ... 
arXiv:cs/0003024v1 fatcat:lsebf4il7zgulb7rxeat7wawna

A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning

James Delgrande, Torsten Schaub, Hans Tompits, Kewen Wang
2004 Computational intelligence  
Here, we present an overview and classification 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-  ... 
doi:10.1111/j.0824-7935.2004.00240.x fatcat:2athvzwyazgobgqki57falevsi

Translating Preferred Answer Set Programs to Propositional Logic [chapter]

Vernon Asuncion, Yan Zhang
2009 Lecture Notes in Computer Science  
may also lead to efficient implementations 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.  ... 
doi:10.1007/978-3-642-04238-6_33 fatcat:h66cycoskrhatdzchkvziwltzi

Order and Negation as Failure [chapter]

Davy Van Nieuwenborgh, Dirk Vermeir
2003 Lecture Notes in Computer Science  
We equip 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.  ... 
doi:10.1007/978-3-540-24599-5_14 fatcat:uu5d7y3jp5afxj3bntapkxa7t4

Pstable Semantics for Logic Programs with Possibilistic Ordered Disjunction [chapter]

Roberto Confalonieri, Juan Carlos Nieves, Javier Vázquez-Salceda
2009 Lecture Notes in Computer Science  
We compare the possibilistic pstable semantics 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.  ... 
doi:10.1007/978-3-642-10291-2_6 fatcat:2ajr2kyxtjb4pebwyrqitngyry

Possibilistic Semantics for Logic Programs with Ordered Disjunction [chapter]

Roberto Confalonieri, Juan Carlos Nieves, Mauricio Osorio, Javier Vázquez-Salceda
2010 Lecture Notes in Computer Science  
In this paper we define a class of nested 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).  ... 
doi:10.1007/978-3-642-11829-6_11 fatcat:tpqstzzeibciricj3r2c666xfm

Preferences and Nonmonotonic Reasoning

Gerhard Brewka, Ilkka Niemela, Miroslaw Truszczynski
2008 The AI Magazine  
Selecting extended 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.  ... 
doi:10.1609/aimag.v29i4.2179 fatcat:2qrcipfj3fd3lirr24go6smm5m

Logic Programming with Ordered Disjunction [article]

Gerhard Brewka
2002 arXiv   pre-print
The semantics of 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.  ... 
arXiv:cs/0207042v1 fatcat:pvjd4z6zjbe6xcuhc5zqhxtlwa

Preferred well-founded semantics for logic programming by alternating fixpoints: Preliminary report [article]

Torsten Schaub, Kewen Wang
2002 arXiv   pre-print
We then specify some informal yet intuitive criteria and propose a semantical framework 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.  ... 
arXiv:cs/0207060v1 fatcat:rjrtsi5uhrgebnstaom7bezrgi

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]

James P. Delgrande, Torsten Schaub, Hans Tompits
2001 Lecture Notes in Computer Science  
This paper describes a generic compiler, called plp, 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  ... 
doi:10.1007/3-540-45402-0_33 fatcat:rwkaqjpguna77l2glllohy45am
« Previous Showing results 1 — 15 out of 216,272 results