A finite-valued solver for disjunctive fuzzy answer set programs

Mushthofa, Mushthofa, Schockaert, Steven ORCID: https://orcid.org/0000-0002-9256-2881 and De Cock, Martine 2014. A finite-valued solver for disjunctive fuzzy answer set programs. Presented at: ECAI, Prague, Czech Republic, 18-22 August 2014. Published in: Schaub, Torschen, Friedrich, Gerhard and O'Sullivan, Barry eds. ECAI 2014: Frontiers in Artificial Intelligence and Applications. , vol.263 IOP Publishing, pp. 645-650. 10.3233/978-1-61499-419-0-645

Preview

PDF - Published Version Available under License Creative Commons Attribution Non-commercial. Download (228kB) | Preview

Abstract

Fuzzy Answer Set Programming (FASP) is a declarative programming paradigm which extends the flexibility and expressiveness of classical Answer Set Programming (ASP), with the aim of modeling continuous application domains. In contrast to the availability of efficient ASP solvers, there have been few attempts at implementing FASP solvers. In this paper, we propose an implementation of FASP based on a reduction to classical ASP. We also develop a prototype implementation of this method. To the best of our knowledge, this is the first solver for disjunctive FASP programs. Moreover, we experimentally show that our solver performs well in comparison to an existing solver (under reasonable assumptions) for the more restrictive class of normal FASP programs.

Item Type:	Conference or Workshop Item (Paper)
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	IOP Publishing
ISBN:	9781614994183
Date of First Compliant Deposit:	30 March 2016
Last Modified:	27 Oct 2022 10:01
URI:	https://orca.cardiff.ac.uk/id/eprint/68593

Citation Data

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

Actions (repository staff only)

Edit Item