Solving disjunctive fuzzy answer set programs

Mushthofa, Mushthofa, Schockaert, Steven ORCID: https://orcid.org/0000-0002-9256-2881 and De Cock, Martine 2015. Solving disjunctive fuzzy answer set programs. Presented at: LPNMR 2015: International Conference on Logic Programming and Nonmonotonic Reasoning, Lexington, KY, USA, 27-30 September 2015. Published in: Calimeri, Francesco, Ianni, Giovambattista and Truszczynski, Miroslaw eds. Logic Programming and Nonmonotonic Reasoning: 13th International Conference, LPNMR 2015, Lexington, KY, USA, September 27-30, 2015. Proceedings. Lecture Notes in Computer Science. Lecture Notes in Computer Science , vol.9345 Springer, pp. 453-466. 10.1007/978-3-319-23264-5_38

Full text not available from this repository.

Abstract

Fuzzy Answer Set Programming (FASP) is an extension of the popular Answer Set Programming (ASP) paradigm which is tailored for continuous domains. Despite the existence of several prototype implementations, none of the existing solvers can handle disjunctive rules in a sound and efficient manner. We first show that a large class of disjunctive FASP programs called the self-reinforcing cycle-free (SRCF) programs can be polynomially reduced to normal FASP programs. We then introduce a general method for solving disjunctive FASP programs, which combines the proposed reduction with the use of mixed integer programming for minimality checking. We also report the result of the experimental benchmark of this method.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	Springer
ISBN:	9783319232638
ISSN:	0302-9743
Last Modified:	31 Oct 2022 10:25
URI:	https://orca.cardiff.ac.uk/id/eprint/84843

Citation Data

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

Actions (repository staff only)

Edit Item