Sciweavers

2526 search results - page 10 / 506
» A New Algorithm for Answer Set Computation
Sort
View
ICTAI
2006
IEEE
14 years 3 months ago
Computing Horn Strong Backdoor Sets Thanks to Local Search
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
Lionel Paris, Richard Ostrowski, Pierre Siegel, La...
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 2 months ago
A New Universal Cellular Automaton Discovered by Evolutionary Algorithms
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Cha...
JCIT
2007
107views more  JCIT 2007»
13 years 9 months ago
A New Approach to Computing Weighted Attributes Values in Incomplete Information Systems
The Rough Sets theory has been conceived to deal with inexact, uncertain or vague knowledge in Information systems. The article is devoted to propose notions including the general...
Tian Hong, Wang Xiukun, Henryk Rybinski
LPNMR
2001
Springer
14 years 1 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
LREC
2008
100views Education» more  LREC 2008»
13 years 10 months ago
Scaling Answer Type Detection to Large Hierarchies
This paper describes the creation of a state-of-the-art answer type detection system capable of recognizing more than 200 different expected answer types with greater than 85% pre...
Kirk Roberts, Andrew Hickl