Preferred answer sets for extended logic programs
From MaRDI portal
Publication:1292319
DOI10.1016/S0004-3702(99)00015-6zbMATH Open0916.68091MaRDI QIDQ1292319FDOQ1292319
Authors: Gerhard Brewka, Thomas Eiter 
Publication date: 21 June 1999
Published in: Artificial Intelligence (Search for Journal in Brave)
Recommendations
nonmonotonic reasoningextended logic programmingoolynomial algorithms and complexitypreference handling
Cited In (55)
- A glimpse on Gerhard Brewka's contributions to artificial intelligence
- Explaining preferences and preferring explanations
- A semantic framework for preference handling in answer set programming
- Preferred answer sets for ordered logic programs
- Computing preferred answer sets by meta-interpretation in Answer Set Programming
- Weakest link in formal argumentation: lookahead and principle-based analysis
- Logic Programming
- Preference Logic Grammars: Fixed point semantics and application to data standardization
- Title not available (Why is that?)
- On the semantics of logic programs with preferences
- The complexity landscape of outcome determination in judgment aggregation
- A selective semantics for logic programs with preferences
- \(\mathcal M\)odular-\(\mathcal E\) and the role of elaboration tolerance in solving the qualification problem
- Translating Preferred Answer Set Programs to Propositional Logic
- Title not available (Why is that?)
- Revealed preference in argumentation: algorithms and applications
- Making assumptions in the automated derivation
- Answer sets and qualitative decision making
- Preferred first-order answer set programs
- Strong order equivalence
- Connectionist computations of intuitionistic reasoning
- Qualitative choice logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Connectionist modal logic: representing modalities in neural networks
- Prioritized logic programming and its application to commonsense reasoning
- Logic Programming with Defaults and Argumentation Theories
- Rich preference-based argumentation frameworks
- Computing preferred answer sets in answer set programming
- Theory and Applications of Models of Computation
- Possibilistic uncertainty handling for answer set programming
- On the Semantics of Logic Programs with Preferences
- An argument-based approach to reasoning with specificity
- A new approach for preference-based argumentation frameworks
- An axiomatic analysis of structured argumentation with priorities
- Reliable Semantics for Extended Logic Programs with Rule Prioritization
- Preferential theory revision
- The Jiminy advisor: moral agreements among stakeholders based on norms and argumentation
- A Revised Qualitative Choice Logic for Handling Prioritized Preferences
- Expressing preferences in default logic
- Logic for Programming, Artificial Intelligence, and Reasoning
- Realistic desires
- Answer set semantics for ordered logic programs
- The complexity class θp2: Recent results and applications in AI and modal logic
- A logic framework for P2P deductive databases
- Fundamental properties of attack relations in structured argumentation with priorities
- Argumentation for practical reasoning: an axiomatic approach
- A semantic approach for web reasoning
- An introduction to fuzzy answer set programming
- Integrated preference argumentation and applications in consumer behaviour analyses
- Accepting the natural order of rules in a logic program with preferences
- Repairing inconsistent answer set programs using rules of thumb: a gene regulatory networks case study
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
- A framework for compiling preferences in logic programs
This page was built for publication: Preferred answer sets for extended logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292319)
