Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction

Schockaert, Steven ORCID: https://orcid.org/0000-0002-9256-2881, Janssen, Jeroen and Vermeir, Dirk 2012. Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction. Journal of Automated Reasoning 49 (4) , pp. 493-550. 10.1007/s10817-011-9227-0

Full text not available from this repository.

Abstract

Although it is well-known that every satisfiable formula in Łukasiewicz’ infinite-valued logic L¥ can be satisfied in some finite-valued logic, practical methods for finding an appropriate number of truth degrees do currently not exist. Extending upon earlier results by Aguzzoli et al., which only take the total number of variable occurrences into account, we present a detailed analysis of what type of formulas require a large number of truth degrees to be satisfied. In particular, we reveal important links between this number of truth degrees and the dimension, and structure, of the cycle space of an associated bipartite graph. We furthermore propose an efficient, polynomial-time algorithm for establishing a strong upper bound on the required number of truth degrees, allowing us to check the satisfiability of sets of formulas in L¥ , and more generally, sets of fuzzy clauses over Łukasiewicz logic formulas, by solving a small number of constraint satisfaction problems. In an experimental evaluation, we demonstrate the practical usefulness of this approach, comparing it with a state-of-the-art technique based on mixed integer programming.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Uncontrolled Keywords:	Fuzzy logic; Satisfiability checking; Łukasiewicz semantics
Publisher:	SpringerLink
ISSN:	0168-7433
Last Modified:	18 Oct 2022 13:30
URI:	https://orca.cardiff.ac.uk/id/eprint/14153

Citation Data

Cited 11 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item