Sciweavers

903 search results - page 167 / 181
» Completeness Results for Memory Logics
Sort
View
POPL
2005
ACM
16 years 6 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
FOCS
1998
IEEE
15 years 10 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
162
Voted
AI
2008
Springer
15 years 6 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini
AI
2007
Springer
15 years 6 months ago
Audiences in argumentation frameworks
Although reasoning about what is the case has been the historic focus of logic, reasoning about what should be done is an equally important capacity for an intelligent agent. Reas...
Trevor J. M. Bench-Capon, Sylvie Doutre, Paul E. D...
IPM
2007
156views more  IPM 2007»
15 years 6 months ago
p2pDating: Real life inspired semantic overlay networks for Web search
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...
Josiane Xavier Parreira, Sebastian Michel, Gerhard...