Sciweavers

53 search results - page 6 / 11
» Logic Programming with Defaults and Argumentation Theories
Sort
View
ECAI
1992
Springer
13 years 11 months ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen
NMR
2004
Springer
14 years 29 days ago
A first approach to argument-based recommender systems based on defeasible logic programming
Recommender systems have evolved in the last years as specialized tools to assist users in a plethora of computermediated tasks by providing guidelines or hints. Most recommender ...
Carlos Iván Chesñevar, Ana Gabriela ...
NMR
2004
Springer
14 years 29 days ago
Preferential defeasibility: utility in defeasible logic programming
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...
Fernando A. Tohmé, Guillermo Ricardo Simari
LPNMR
1993
Springer
13 years 11 months ago
An Assumption-Based Framework for Non-Monotonic Reasoning
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
Andrei Bondarenko, Francesca Toni, Robert A. Kowal...
PPDP
2010
Springer
13 years 6 months ago
Permissive-nominal logic
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
Gilles Dowek, Murdoch James Gabbay