Sciweavers

3446 search results - page 20 / 690
» A Reasoning Algorithm for pD*
Sort
View
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
14 years 11 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
CORR
2010
Springer
68views Education» more  CORR 2010»
15 years 1 months ago
An Optimization for Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
Cristina Feier, Stijn Heymans
ALDT
2009
Springer
158views Algorithms» more  ALDT 2009»
14 years 11 months ago
Axioms for a Class of Algorithms of Sequential Decision Making
Abstract. We axiomatically characterise a class of algorithms for making sequential decisions in situations of complete ignorance. These algorithms assume that a decision maker (DM...
Murali Agastya, Arkadii M. Slinko
KR
2000
Springer
15 years 4 months ago
Partition-Based Logical Reasoning
We investigate the problem of reasoning with partitions of related logical axioms. Our motivation is two-fold. First, we are concerned with how to reason effectively with multiple...
Eyal Amir, Sheila A. McIlraith
AI
1999
Springer
15 years 29 days ago
Topological Inference of Teleology: Deriving Function from Structure via Evidential Reasoning
Reasoning about the physical world is a central human cognitive activity. One aspect of such reasoning is the inference of function from the structure of the artifacts one encount...
John O. Everett