4401 search results - page 484 / 881 » Computing with Default Logic |
193
click to vote
COMMA
2008
15 years 8 months ago
2008
This paper formulates in the first part some requirements for a certain sort of computational argumentation systems, namely those which are designed for a very specific purpose: to...
195
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
This is to present work on modifying the Aleph ILP system so that it evaluates the hypothesised clauses in parallel by distributing the data-set among the nodes of a parallel or di...
196
click to vote
JLP
2006
15 years 6 months ago
2006
This paper describes in detail how to bridge the gap between theory and practice when implementing in Maude structural operational semantics described in rewriting logic, where tr...
195
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
190
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The exp...