Gerhard Brewka  Home/Search
Context Related
| cmu.edu/afs/cs/project...brewka96a.ps.Z washington.edu/research/...brewka96a.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: washington.edu/...withabstracts (more) From: eia.udg.es/~oll...withabstracts (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension information about preferences between rules can be expressed in the logical language and derived dynamically. This is achieved by using a reserved predicate symbol and a naming technique. Conflicts among rules are resolved whenever possible on the basis of derived preference information. The well-founded conclusions of prioritized logic programs can be computed in... (Update)
Cited by: More
Defeasible Logic Programming - An Argumentative Approach - Garcia, Simari (2003) (Correct)
Towards a Classification of Preference Handling.. - Delgrande, Schaub.. (2003) (Correct)
Logic Programming with Cardinality Constraints - Syrjänen (2003) (Correct)
Similar documents (at the sentence level):
41.2%: Knowledge Representation with Logic Programs - Gerhard Brewka, Jürgen Dix (1997) (Correct)
33.1%: Logic Programs with Context-Dependent Preferences - Brewka (1999) (Correct)
Active bibliography (related documents): More All
0.4: Prioritizing Default Logic - Brewka, Eiter (1998) (Correct)
0.3: Representation and Reasoning for Goals in BDI Agents - Thangarajah, Padgham, Harland (Correct)
0.2: On the Relationship Between Defeasible Logic and Well-Founded.. - Brewka (2001) (Correct)
Similar documents based on text: More All
0.3: Set Semantics and Operations Based Upon Answer Set Semantics - James Jones Computer (2001) (Correct)
0.2: Preferred Answer Sets for Extended Logic Programs - Brewka, Eiter (1999) (Correct)
0.2: Prioritized Default Theories: a new characterization. - Benhammadi, Nicolas (Correct)
Related documents from co-citation: More All
31: Preferred answer sets for extended logic programs - Brewka, Eiter - 1998
24: Reasoning with Prioritized Defaults - Gelfond, Son - 1998
22: Answer sets for prioritized logic programs - Zhang, Foo - 1997
BibTeX entry: (Update)
G. Brewka. Well-founded semantics for extended logic programs with dynamic preferences. Journal of Artificial Intelligence Research, 14:19--36, 1996. http://citeseer.ist.psu.edu/103686.html More
@article{ brewka96wellfounded,
author = "Gerhard Brewka",
title = "Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences",
journal = "Journal of Artificial Intelligence Research",
volume = "4",
pages = "19-36",
year = "1996",
url = "citeseer.ist.psu.edu/103686.html" }
Citations (may not include all citations):850 A logic for default reasoning (context) - Reiter - 1980
270 Logic programs with classical negation (context) - Gelfond, Lifschitz - 1990
258 A lattice-theoretical fixpoint theorem and its applications (context) - Tarski - 1955
191 Linear time algorithms for testing the satisfiability of pro.. (context) - Dowling, Gallier - 1984
166 Computing circumscription (context) - Lifschitz - 1985
159 The acceptability of arguments and its fundamental role in n.. - Dung - 1993
149 Logic programming and knowledge representation - Baral, Gelfond - 1994
125 The well-founded semantics coincides with the three-valued s.. - Przymusinski - 1990
120 Stable semantics for disjunctive programs - Przymusinski - 1991
110 Well founded semantics for logic programs with explicit nega.. (context) - Pereira, Alferes - 1992
81 Logic programs with exceptions (context) - Kowalski, Sadri - 1991
65 the comparison of theories: Preferring the most specific exp.. (context) - Poole - 1985
62 Reasoning about priorities in default logic (context) - Brewka
51 Adding priorities and specificity to default logic (context) - Brewka
42 Hierarchic autoepistemic theories for nonmonotonic reasoning (context) - Konolige - 1988
30 The Pleadings Game: An Artificial Intelligence Model of Proc.. - Gordon - 1993
21 Stable models and their computation for logic programming wi.. (context) - Buccafurri, Leone et al. - 1996
20 the relation between legal language and legal argument: Assu.. - Prakken, Sartor - 1995
18 The Mathematics of Inheritance (context) - Touretzky - 1986
14 Duality between alternative semantics of logic programs and .. (context) - Baral, Subrahmanian - 1991
7 Partial semantics for truth maintenance (context) - Witteveen - 1991
6 Foundations of declarative logic programming (context) - Lifschitz - 1996
3 A skeptic's menagerie: Conflictors (context) - Touretzky, Thomason et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.washington.edu/research/jair/contents/complete-with-abstracts.html): More
A Uniform Framework for Concept Definitions in Description.. - De Giacomo, Lenzerini (1997) (Correct)
Lifeworld Analysis - Agre, Horswill (1997) (Correct)
The Design and Experimental Analysis of Algorithms for.. - van Beek, Manchak (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC