A Framework for Compiling Preferences in Logic Programs: Difference between revisions
Created page with "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, an extended logic program that includes named rules and preferences specified by a set of atoms. They develop a specific approach to reasoning with preferences, where the preference ordering specifies th..." |
No edit summary |
||
| Line 2: | Line 2: | ||
Abstract: | 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, an extended logic program | 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 | 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: | 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 | 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: | Results: | ||
The | 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: | Implications: | ||
The research | 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/ | Link to Article: https://arxiv.org/abs/0203005v2 | ||
Authors: | Authors: | ||
arXiv ID: | arXiv ID: 0203005v2 | ||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
[[Category:Logic]] | [[Category:Logic]] | ||
[[Category:Preferences]] | [[Category:Preferences]] | ||
[[Category:Framework]] | [[Category:Framework]] | ||
[[Category: | [[Category:Reasoning]] | ||
[[Category:Can]] | |||
Latest revision as of 04:15, 24 December 2023
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