Finite satisfiability in infinite-valued Lukasiewicz logic

Schockaert, Steven ORCID: https://orcid.org/0000-0002-9256-2881, Janssen, J., Vermeir, D. and De Cok, M. 2009. Finite satisfiability in infinite-valued Lukasiewicz logic. Lecture Notes in Computer Science (5785) , pp. 240-254. 10.1007/978-3-642-04388-8_19

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. As a first step towards efficient reasoning in L∞ , we propose a method to find a tight upper bound on this number which, in practice, often significantly improves the worst-case upper bound of Aguzzoli et al.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Schools > Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software
Additional Information:	Scalable uncertainty management : Proceedings of the third international conference, SUM 2009, Washington, DC, September 28-30, 2009
Publisher:	Springer Verlag
ISBN:	9783642043871
ISSN:	0302-9743
Last Modified:	20 Oct 2022 09:24
URI:	https://orca.cardiff.ac.uk/id/eprint/31829

Citation Data

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

Actions (repository staff only)

Edit Item