Sciweavers

175 search results - page 11 / 35
» Generalizing stable semantics by preferences
Sort
View
KR
2004
Springer
14 years 26 days ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
ASP
2001
Springer
14 years 5 hour ago
Well Founded Semantics as Two dimensional Here and There
This workpresents a newlogical characterization of well foundedsemanticsthat provides, as interesting innovation, a fully semantic-oriented treatment of programconnectives without...
Pedro Cabalar
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...
ACL
2008
13 years 9 months ago
Contextual Preferences
The validity of semantic inferences depends on the contexts in which they are applied. We propose a generic framework for handling contextual considerations within applied inferen...
Idan Szpektor, Ido Dagan, Roy Bar-Haim, Jacob Gold...
CORR
2002
Springer
131views Education» more  CORR 2002»
13 years 7 months ago
Logic Programming with Ordered Disjunction
Abstract. Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunct...
Gerhard Brewka