Sciweavers

25 search results - page 3 / 5
» Preferred Subtheories: An Extended Logical Framework for Def...
Sort
View
JELIA
2000
Springer
13 years 9 months ago
A Compilation of Brewka and Eiter's Approach to Prioritization
In previous work, we developed a framework for expressing general preference information in default logic and logic programming. Here we show that the approach of Brewka and Eiter ...
James P. Delgrande, Torsten Schaub, Hans Tompits
ICLP
2009
Springer
14 years 7 months ago
Logic Programming with Defaults and Argumentation Theories
We define logic programs with defaults and argumentation theories, a new framework that unifies most of the earlier proposals for defeasible reasoning in logic programming. We pres...
Hui Wan, Benjamin N. Grosof, Michael Kifer, Paul F...
LPNMR
2001
Springer
13 years 10 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
ASP
2003
Springer
13 years 11 months ago
Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
Robert E. Mercer, Vincent Risch
AGP
2003
IEEE
13 years 11 months ago
Ordered Programs as Abductive Systems
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
Davy Van Nieuwenborgh, Dirk Vermeir