Sciweavers

188 search results - page 17 / 38
» Evaluation of representations in AI problem solving
Sort
View
AI
2007
Springer
13 years 7 months ago
Learning action models from plan examples using weighted MAX-SAT
AI planning requires the definition of action models using a formal action and plan description language, such as the standard Planning Domain Definition Language (PDDL), as inp...
Qiang Yang, Kangheng Wu, Yunfei Jiang
CORR
2008
Springer
84views Education» more  CORR 2008»
13 years 7 months ago
The Latent Relation Mapping Engine: Algorithm and Experiments
Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure ...
Peter D. Turney
AI
2008
Springer
13 years 7 months ago
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
ECAI
2008
Springer
13 years 9 months ago
Incremental Diagnosis of DES by Satisfiability
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
Alban Grastien, Anbulagan
FOCS
1998
IEEE
13 years 12 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