Sciweavers

400 search results - page 19 / 80
» What Makes a Problem GP-Hard
Sort
View
JAR
2007
132views more  JAR 2007»
13 years 7 months ago
Visualizing SAT Instances and Runs of the DPLL Algorithm
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
Carsten Sinz
COGSCI
2004
80views more  COGSCI 2004»
13 years 7 months ago
Reinstatement, floating conclusions, and the credulity of Mental Model reasoning
Johnson-Laird and coworkers' Mental Model theory of propositional reasoning is shown to be somewhere in between what logicians have defined as "credulous" and "...
Jean-François Bonnefon
WETICE
2006
IEEE
14 years 1 months ago
Exploiting the TTL Rule in Unstructured Peer-to-Peer Networks
Peer-to-Peer networks exist with the volunteering cooperation of various entities on the Internet. Their self-structure nature has the important characteristic that they make no u...
Georgios Pitsilis, Panayiotis Periorellis
EJC
2006
13 years 8 months ago
Ontological Queries Supporting Decision Process in KaSeA System
With development of knowledge bases (KB) there appeared expert systems that use KBs to support them in decision making process. Decision Support Systems, that are the subject of th...
Krzysztof Goczyla, Aleksander Waloszek, Wojciech W...
EMNLP
2006
13 years 8 months ago
Paraphrase Recognition via Dissimilarity Significance Classification
We propose a supervised, two-phase framework to address the problem of paraphrase recognition (PR). Unlike most PR systems that focus on sentence similarity, our framework detects...
Long Qiu, Min-Yen Kan, Tat-Seng Chua