Suitable for modeling problems with continuous domains, this title shows how ASP techniques can be generalized to FASP, paving the way to implement fuzzy answer set solvers, that can take advantage of existing fuzzy reasoners.
Suitable for modeling problems with continuous domains, this title shows how ASP techniques can be generalized to FASP, paving the way to implement fu...
Answer set programming (ASP) is a declarative language tailored towards solving combinatorial optimization problems. It has been successfully applied to e.g. planning problems, configuration and verification of software, diagnosis and database repairs. However, ASP is not directly suitable for modeling problems with continuous domains. Such problems occur naturally in diverse fields such as the design of gas and electricity networks, computer vision and investment portfolios. To overcome this problem we study FASP, a combination of ASP with fuzzy logic -- a class of manyvalued logics that can...
Answer set programming (ASP) is a declarative language tailored towards solving combinatorial optimization problems. It has been successfully applied ...
