1,359,287 research outputs found
Fast Prototyping of a Solver for Reduct-based ELP Semantics
No full textSeveral semantic approaches have been proposed over time for Epistemic Logic Programs (ELPs), which is an extension to Answer Set Programming (ASP) with epistemic operators. ELP semantics has been defined, in various ways, in terms of world views, which are sets whose elements are sets of atoms. Several semantic approaches are Reduct-based, i.e., extend to ELPs what done for ASP, in the sense that in order to find the world views of a given program they propose to: start with a candidate world view; build the reduct of the program with respect to this candidate world view, according to some specific definition of such reduct; compute the set of stable models of the reduct; check whether the candidate world view is indeed a world view, which is the case if it coincides with the set of stable models of the reduct. Solvers have been developed for some of these approaches, but new semantics/variations have been introduced, and are likely to be introduced in the future, as there is no consensus yet on the “right” semantics. We propose a fast-prototyping approach to obtain a solver for any reduct-based semantics, with the advantage to be able to experiment the approach on small/medium programs, and not only on very small programs as done so far, prior to undertaking the costly process of developing a dedicated solver
Fast Prototyping of a Solver for Reduct-based ELP Semantics
No full textSeveral semantic approaches have been proposed over time for Epistemic Logic Programs (ELPs), which is an extension to Answer Set Programming (ASP) with epistemic operators. ELP semantics has been defined, in various ways, in terms of world views, which are sets whose elements are sets of atoms. Several semantic approaches are Reduct-based, i.e., extend to ELPs what done for ASP, in the sense that in order to find the world views of a given program they propose to: start with a candidate world view; build the reduct of the program with respect to this candidate world view, according to some specific definition of such reduct; compute the set of stable models of the reduct; check whether the candidate world view is indeed a world view, which is the case if it coincides with the set of stable models of the reduct. Solvers have been developed for some of these approaches, but new semantics/variations have been introduced, and are likely to be introduced in the future, as there is no consensus yet on the “right” semantics. We propose a fast-prototyping approach to obtain a solver for any reduct-based semantics, with the advantage to be able to experiment the approach on small/medium programs, and not only on very small programs as done so far, prior to undertaking the costly process of developing a dedicated solver
Preference Management in Epistemic Logic L-DINF
No full textThe Logic of “Inferable” L-DINF has been recently proposed as a declarative framework to formally model via epistemic logic the group dynamics of cooperative agents. In this paper, we extend the framework by introducing the possibility to have costs for execution of physical action. Such costs may require the consumption of multiple resources of various types, to be drawn from agents' budgets. Also, we emphasize that all aspects of Multi-Agent Systems specified in L-DINF can be formalized in a modular way. In particular, concerning the execution of physical actions, dedicated modules allow the specification of a notion of equivalence for actions and a notion of agents' preference, be used to affect action execution
America sive Mundus Novus. Le lettere a stampa attribuite ad Amerigo Vespucci
No full textTraduzione con Introduzione e commento (di carattere non divulgativo) del "Mundus Novus" e della "Lettera a Piero Soderini" attribuiti ad Amerigo Vespucci. Luciano Formisano è responsabile della parte relativa alla "Lettera" (pp. 55-137, 197-199)
Towards explainable data-to-text generation
No full textIn recent years there has been a renewed burst of interest in systems able to textually summarize data, producing natural language text as a description of input data series. Many of the recently proposed approaches to solve the data-to-text task are based on Machine Learning (ML) and ultimately rely on Deep Learning (DL) techniques. This technological choice often prevents the system from enjoying explainability properties. In this paper we outline our ongoing research and present a framework that is ML/DL free and is conceived to be compliant with xAI requirements. In particular we design ASP/Python programs that enable explicit control of the abstraction process, descriptions' accuracy and relevance handling, and amount of synthesis. We provide a critical analysis of the xAI features that should be implemented and a working proof of concept that addresses crucial aspects in the abstraction of data. In particular we discuss: how to model and output the abstraction accuracy of a concept w.r.t. data; how to identify what to say with controlled synthesis level: i.e., the key descriptive elements to be addressed in the data; how to represent abstracted information by means of visual annotation to charts. The main advantages of such approach are a trustworthy and reliable description, a transparent methodology, logically provable output, and measured accuracy that can control natural language modulation of descriptions
Flexible Measures in Magnetic Active Shielding
No full textBrowse Conference Publications > Electromagnetic Field Computa ...
Flexible measures in magnetic Active Shielding .This paper appears in:
Electromagnetic Field Computation (CEFC), 2010 14th Biennial IEEE Conference on
Date of Conference: 9-12 May 2010
Author(s): Formisano, A.
Dip. Ing. dell'Inf., Seconda Univ. di Napoli, Aversa, Italy
Lupoli, M.C. ; Martone, R.
Page(s): 1
Product Type: Conference Publications
5481633 searchabstract .Abstract
The reduction in protected regions of low frequency magnetic fields is a complex problem when the sources are not known. The paper proposes a procedure able to choose the best currents able to mitigate the disturbance field. The magnetic field is represented by suitable series of eigenfunctions in the domain of interest. The procedure includes a field identification step starting from a set of measurements and a current design step, possibly based on a preliminary design of specialized shimming coils sets
23rd RCRA International workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
No full text
- …
