Sciweavers

567 search results - page 21 / 114
» Probabilistic Reasoning With Answer Sets
Sort
View
ENC
2008
IEEE
14 years 5 months ago
Possibilistic-Based Argumentation: An Answer Set Programming Approach
In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable fr...
Juan Carlos Nieves, Ulises Cortés, Mauricio...
LPNMR
2009
Springer
14 years 3 months ago
On Reductive Semantics of Aggregates in Answer Set Programming
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building ...
Joohyung Lee, Yunsong Meng
LPNMR
1999
Springer
14 years 3 months ago
Representing Transition Systems by Logic Programs
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
Vladimir Lifschitz, Hudson Turner
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
15 years 8 days ago
Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data
on Uncertain Data (Extended Abstract) Ming Hua Jian Pei Wenjie Zhang Xuemin Lin Simon Fraser University, Canada The University of New South Wales & NICTA {mhua, jpei}@cs.sfu.c...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
ASP
2003
Springer
14 years 4 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke