Sciweavers

52 search results - page 9 / 11
» On the Relationship of Defeasible Argumentation and Answer S...
Sort
View
COMMA
2006
13 years 7 months ago
Semi-Stable Semantics
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...
Martin Caminada
LANMR
2007
13 years 7 months ago
Handling Exceptions in nonmonotonic reasoning
Abstract We introduce some differences in the style defeasible information is represented and inferences are made in nonmonotonic reasoning. These, at first sight harmless, chang...
Marcelino C. Pequeno, Rodrigo de M. S. Veras, Wlad...
IJCAI
2001
13 years 7 months ago
A Comparative Study of Logic Programs with Preference
We are interested in semantical underpinnings for existing approaches to preference handling in extended logic programming (within the framework of answer set programming). As a s...
Torsten Schaub, Kewen Wang
CORR
2004
Springer
124views Education» more  CORR 2004»
13 years 5 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
EDBT
2009
ACM
113views Database» more  EDBT 2009»
14 years 25 days ago
Query ranking in probabilistic XML data
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
Lijun Chang, Jeffrey Xu Yu, Lu Qin