Editing
A Framework for Compiling Preferences in Logic Programs
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
Title: A Framework for Compiling Preferences in Logic Programs Abstract: This research proposes a methodology and framework for expressing general preference information in logic programming under the answer set semantics. The authors introduce an ordered logic program, which is an extended logic program with named rules and preferences specified by a set of atoms of form s≺t. They develop a specific approach to reasoning with preferences, wherein the preference ordering specifies the order in which rules are to be applied. The authors demonstrate the wide range of applicability of their framework by showing how other approaches can be captured within it. They develop a compiler as a front-end for existing logic programming systems like dlv and smodels. Research Question: How can we develop a framework for expressing and reasoning with preferences in logic programming that is general, efficient, and easily applicable to various existing systems? Methodology: The authors propose an ordered logic program, which is an extended logic program with named rules and preferences specified by a set of atoms of form s≺t. They develop a specific approach to reasoning with preferences, wherein the preference ordering specifies the order in which rules are to be applied. Results: The authors show that their approach allows for the specification of dynamic orderings, where preferences can appear arbitrarily within a program. They demonstrate the wide range of applicability of their framework by showing how other approaches can be captured within it. They develop a compiler as a front-end for existing logic programming systems like dlv and smodels. Implications: The research has significant implications for the field of logic programming. It provides a general and efficient framework for expressing and reasoning with preferences, which can be easily applied to various existing systems. This can lead to more accurate and realistic models in areas such as commonsense reasoning and legal reasoning, where preferences play a crucial role. Link to Article: https://arxiv.org/abs/0203005v2 Authors: arXiv ID: 0203005v2 [[Category:Computer Science]] [[Category:Logic]] [[Category:Preferences]] [[Category:Framework]] [[Category:Reasoning]] [[Category:Can]]
Summary:
Please note that all contributions to Simple Sci Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Simple Sci Wiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
Edit source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information