Sciweavers

1532 search results - page 89 / 307
» The Symbol Grounding Problem
Sort
View
ASP
2005
Springer
15 years 9 months ago
A Preliminary Report on Integrating of Answer Set and Constraint Solving
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
ECSQARU
2005
Springer
15 years 9 months ago
Symmetric Argumentation Frameworks
This paper is centered on the family of Dung’s finite argumentation frameworks when the attacks relation is symmetric (and nonempty and irreflexive). We show that while this fa...
Sylvie Coste-Marquis, Caroline Devred, Pierre Marq...
AICCSA
2007
IEEE
99views Hardware» more  AICCSA 2007»
15 years 8 months ago
Quine-McCluskey Classification
In this paper the Karnaugh and Quine-McCluskey methods are used for symbolic classification problem, and then these methods are compared with other famous available methods. Becau...
Javad Safaei, Hamid Beigy
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 8 months ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...
AAAI
2008
15 years 6 months ago
Limits and Possibilities of BDDs in State Space Search
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
Stefan Edelkamp, Peter Kissmann