China
Africa
Explore chapters and articles related to this topic
NovaDM: Towards a formal, unified Renovation Domain Model for the generation of holistic renovation scenarios
Published in Jan Karlshøj, Raimar Scherer, eWork and eBusiness in Architecture, Engineering and Construction, 2018
A. Kamari, C. Schultz, P.H. Kirkegaard
We have implemented a NovaDM parser (in C++) that: reads a text file description of (a) action trees and (b) subject-feature knowledge bases;generates all actions (grouped by alternatives);exports the sets of actions in a variety of formats. Currently we support export to CSV and the logic programming language Answer Set Programming (similar to Prolog) to facilitate the querying of actions.
Preorder-based triangle: a modified version of bilattice-based triangle for belief revision in nonmonotonic reasoning
Published in Journal of Experimental & Theoretical Artificial Intelligence, 2018
Kumar S. Ray, Sandip Paul, Diganta Saha
Answer Set Programming (ASP) is a well established nonmonotonic reasoning paradigm for commonsense reasoning in discrete domain. This reasoning formalism cannot deal with vague and uncertain information. Possibilistic Fuzzy Answer Set Programming (PFASP) (Bauters, Schockaert, Janssen, Vermeir, & De Cock, 2010) is an extension of ASP for reasoning in continuous domain in presence of uncertainties. Thus, PFASP performs nonmonontonic reasoning in presence of both vagueness and uncertainty.
Towards transformational creation of novel songs
Published in Connection Science, 2019
Jukka M. Toivanen, Matti Järvisalo, Olli Alm, Dan Ventura, Martti Vainio, Hannu Toivonen
Answer set programming. As the constraint programming paradigm of choice, we use answer set programming (ASP). While we here rely on ASP due to the high-level, data-driven declarative language it offers, together with relatively efficient optimisation solver technology available for the language, we acknowledge that other constraint optimisation paradigms could be alternatively applied.