Sciweavers

58 search results - page 8 / 12
» Possibilistic uncertainty handling for answer set programmin...
Sort
View
IJCAI
2001
13 years 9 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
CAV
2005
Springer
110views Hardware» more  CAV 2005»
14 years 1 months ago
Extended Weighted Pushdown Systems
Recent work on weighted-pushdown systems shows how to generalize interprocedural-dataflow analysis to answer “stack-qualified queries”, which answer the question “what data...
Akash Lal, Thomas W. Reps, Gogul Balakrishnan
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 9 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
CORR
2004
Springer
124views Education» more  CORR 2004»
13 years 7 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
IJCAI
2007
13 years 9 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein