Sciweavers

3446 search results - page 14 / 690
» A Reasoning Algorithm for pD*
Sort
View
118
Voted
DLOG
2011
14 years 3 months ago
Implementing Completion-Based Inferences for the EL-family
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
Julian Mendez, Andreas Ecke, Anni-Yasmin Turhan
AI
2005
Springer
14 years 11 months ago
Unifying tree decompositions for reasoning in graphical models
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction ...
Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dech...
AI
1999
Springer
14 years 11 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
14 years 9 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
VMCAI
2007
Springer
15 years 5 months ago
Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning
Abstract. This paper presents a novel shape analysis algorithm with local reasoning that is designed to analyze heap structures with structural invariants, such y-linked lists. The...
Sigmund Cherem, Radu Rugina