Sciweavers

517 search results - page 52 / 104
» Computing Fuzzy Answer Sets Using dlvhex
Sort
View
ICLP
2005
Springer
14 years 4 months ago
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
ICDAR
2009
IEEE
13 years 9 months ago
Selecting Features in On-Line Handwritten Whiteboard Note Recognition: SFS or SFFS?
When selecting features with the sequential forward floating selection (SFFS), the "nesting effect" is avoided, which is a common phenomenon if the computationally less ...
Joachim Schenk, Moritz Kaiser, Gerhard Rigoll
CADE
2003
Springer
14 years 11 months ago
Certifying Solutions to Permutation Group Problems
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
Arjeh M. Cohen, Scott H. Murray, Martin Pollet, Vo...
TCS
2010
13 years 9 months ago
Invariant games
In the context of 2-player removal games, we define the notion of invariant game for which each allowed move is independent of the position it is played from. We present a family ...
Éric Duchêne, Michel Rigo
FUIN
2007
123views more  FUIN 2007»
13 years 11 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc