Name
Abstract | ||
|---|---|---|
Although it is well-known that every satisfiable formula in Lukasiewicz' infinite-valued logic L-infinity can be satisfied in some finite-valued logic, practical methods for finding an appropriate number of truth degrees do currently not exist. As a first step towards efficient reasoning in L-infinity, we propose a method to find a tight upper bound on this number which, in practice, often significantly improves the worst-case tipper bound of Aguzzoli et al. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-04388-8_19 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
upper bound,satisfiability | Discrete mathematics,Finite satisfiability,Combinatorics,Łukasiewicz logic,Upper and lower bounds,Artificial intelligence,Machine learning,Mathematics | Conference |
Volume | ISSN | Citations |
5785 | 0302-9743 | 1 |
PageRank | References | Authors |
0.38 | 14 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Steven Schockaert | 1 | 583 | 57.95 |
| Jeroen Janssen | 2 | 71 | 6.17 |
| Dirk Vermeir | 3 | 694 | 85.34 |
| Martine De Cock | 4 | 1341 | 96.06 |