A Fixpoint Semantics for Ordered Logic

Laenens, Els; Vermeir, Dirk

doi:10.1093/logcom/1.2.159

Cited by 55 publications

(27 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ordered choice logic programming uses the intuition of defeating from ordered logic programming (OLP) [22,24] to select the most favourable alternative of a decision. In fact, every ordered logic program can be transformed into a OCLP such that the answer set semantics reflects the credulous semantics of the OCLP.…”

Section: Relationship To Other Approachesmentioning

confidence: 99%

Implementing Ordered Choice Logic Programming Using Answer Set Solvers

Vos

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This complete absence of negation does not weaken the language as both forms (classical and as-failure) can be intuitively simulated in the language and eliminated using a simple pre-processor, making it also an easy language for users less familiar with logic programming. The semantics of the language is based on the preference between alternatives, yielding both a skeptical and a credulous approach. In this paper we demonstrate how OCLPs can be translated to semi-negative logic programs such that, depending on the transformation, the answer sets of the latter correspond with the skeptical/credulous answer sets of the former. By providing such a mapping, we have a mechanism for implementing OCLP using answer set solvers like Smodels or dlv. We end with a discussion of the complexity of our system and the reasoning tasks it can perform.

show abstract

Section: Relationship To Other Approachesmentioning

confidence: 99%

Implementing Ordered Choice Logic Programming Using Answer Set Solvers

Vos

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Inheritance Programs 6.6 (Buccafurri et al, 1999a) Static order over (Buccafurri et al, 1999b) rules, with program rewriting Preference Theories 6.7 (Brewka, 2000) Dynamic priorities over rules at the object level, with ad hoc semantics Ordered LPs 6.8 (Laenens & Vermeir, 1990) Dynamic priorities (Gabbay et al, 1991) over rules at the (Buccafurri et al, 1999c) object level adopted for different customers: e.g., customers usually buying expensive articles may be presented with expensive items first (in order to maximize the profit, in case the customer decides to buy something), while customers who in the past preferred cheaper items may be presented a list in inverse order, to encourage them to buy. Concerning the possibility of addressing preferences over preferences, methods with explicit priorities in the knowledge base itself are to be preferred, like the ones in Sections 6.…”

Section: Preference Handlingmentioning

confidence: 99%

Using methods of declarative logic programming for intelligent information agents

Eiter¹,

Fink²,

Sabbatini³

et al. 2002

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

At present, the search for specific information on the World Wide Web is faced with several problems, which arise on the one hand from the vast number of information sources available, and on the other hand from their intrinsic heterogeneity, since standards are missing. A promising approach for solving the complex problems emerging in this context is the use of multi-agent systems of information agents, which cooperatively solve advanced information-retrieval problems. This requires advanced capabilities to address complex tasks, such as search and assessment of information sources, query planning, information merging and fusion, dealing with incomplete information, and handling of inconsistency.In this paper, our interest lies in the role which some methods from the field of declarative logic programming can play in the realization of reasoning capabilities for information agents. In particular, we are interested to see in how they can be used, extended, and further developed for the specific needs of this application domain. We review some existing systems and current projects, which typically address information-integration problems. We then focus on declarative knowledge-representation methods, and review and evaluate approaches and methods from logic programming and nonmonotonic reasoning for information agents. We discuss advantages and drawbacks, and point out the possible extensions and open issues.

show abstract

“…Moreover, the action chosen should be a "best response" to the other players' actual choices. 5 Note that the actions of the other players are not actually known to $ . 6 We abuse notation by writing …”

Section: Definition 6 ([6]) a Strategic Game Is A Tuplementioning

confidence: 99%

Choice Logic Programs and Nash Equilibria in Strategic Games

Vos¹,

Vermeir²

1999

Computer Science Logic

View full text Add to dashboard Cite

Abstract. We define choice logic programs as negation-free datalog programs that allow rules to have exclusive-only disjunctions in the head. We show that choice programs are equivalent to semi-negative datalog programs, at least as far as stable models are concerned. We also discuss an application where strategic games can be naturally formulated as choice programs; it turns out that the stable models of such programs capture exactly the set of Nash equilibria.

show abstract

A Fixpoint Semantics for Ordered Logic

Cited by 55 publications

References 0 publications

Implementing Ordered Choice Logic Programming Using Answer Set Solvers

Implementing Ordered Choice Logic Programming Using Answer Set Solvers

Using methods of declarative logic programming for intelligent information agents

Choice Logic Programs and Nash Equilibria in Strategic Games

Contact Info

Product

Resources

About