Last 12 months (1)
Over 3 years (6)
Politics and International Relations (1)
Theory and Practice of Logic Programming (4)
Mathematical Structures in Computer Science (1)
RAIRO - Theoretical Informatics and Applications (1)
The Journal of Symbolic Logic (1)
Association for Symbolic Logic (1)
Introduction to the 35th International Conference on Logic Programming Special Issue
ESRA ERDEM, ANDREA FORMISANO, GERMÁN VIDAL, FANGKAI YANG
Journal: Theory and Practice of Logic Programming / Volume 19 / Issue 5-6 / September 2019
Published online by Cambridge University Press: 20 September 2019, pp. 630-635
Print publication: September 2019
This volume contains the regular papers of the 35th International Conference on Logic Programming (ICLP 2019), held in Las Cruces, New Mexico, USA, from September 20 to September 25, 2019.
Query answering in resource-based answer set semantics*
STEFANIA COSTANTINI, ANDREA FORMISANO
Published online by Cambridge University Press: 14 October 2016, pp. 619-635
In recent work we defined resource-based answer set semantics, which is an extension to answer set semantics stemming from the study of its relationship with linear logic. In fact, the name of the new semantics comes from the fact that in the linear-logic formulation every literal (including negative ones) were considered as a resource. In this paper, we propose a query-answering procedure reminiscent of Prolog for answer set programs under this extended semantics as an extension of XSB-resolution for logic programs with negation. 1 We prove formal properties of the proposed procedure. Under consideration for acceptance in TPLP.
Autonomous agents coordination: Action languages meet CLP( $\mathcal {FD}$ ) and Linda*
AGOSTINO DOVIER, ANDREA FORMISANO, ENRICO PONTELLI
Journal: Theory and Practice of Logic Programming / Volume 13 / Issue 2 / March 2013
Print publication: March 2013
The paper presents a knowledge representation formalism, in the form of a high-level Action Description Language (ADL) for multi-agent systems, where autonomous agents reason and act in a shared environment. Agents are autonomously pursuing individual goals, but are capable of interacting through a shared knowledge repository. In their interactions through shared portions of the world, the agents deal with problems of synchronization and concurrency; the action language allows the description of strategies to ensure a consistent global execution of the agents' autonomously derived plans. A distributed planning problem is formalized by providing the declarative specifications of the portion of the problem pertaining to a single agent. Each of these specifications is executable by a stand-alone CLP-based planner. The coordination among agents exploits a Linda infrastructure. The proposal is validated in a prototype implementation developed in SICStus Prolog.
A graphical representation of relational formulae with complementation∗
Domenico Cantone, Andrea Formisano, Marianna Nicolosi Asmundo, Eugenio Giovanni Omodeo
Journal: RAIRO - Theoretical Informatics and Applications / Volume 46 / Issue 2 / April 2012
Published online by Cambridge University Press: 27 February 2012, pp. 261-289
Print publication: April 2012
We study translations of dyadic first-order sentences into equalities between relational expressions. The proposed translation techniques (which work also in the converse direction) exploit a graphical representation of formulae in a hybrid of the two formalisms. A major enhancement relative to previous work is that we can cope with the relational complement construct and with the negation connective. Complementation is handled by adopting a Smullyan-like uniform notation to classify and decompose relational expressions; negation is treated by means of a generalized graph-representation of formulae in ℒ+, and through a series of graph-transformation rules which reflect the meaning of connectives and quantifiers.
Multivalued action languages with constraints in CLP(FD)1
Action description languages, such as and ℬ (Gelfond and Lifschitz, Electronic Transactions on Artificial Intelligence, 1998, vol. 2, pp. 193—210), are expressive instruments introduced for formalizing planning domains and planning problem instances. The paper starts by proposing a methodology to encode an action language (with conditional effects and static causal laws), a slight variation of ℬ, using Constraint Logic Programming over Finite Domains. The approach is then generalized to raise the use of constraints to the level of the action language itself. A prototype implementation has been developed, and the preliminary results are presented and discussed.
Comparative uncertainty: theory and automation
ANDREA CAPOTORTI, ANDREA FORMISANO
Journal: Mathematical Structures in Computer Science / Volume 18 / Issue 1 / February 2008
Published online by Cambridge University Press: 01 February 2008, pp. 57-79
Print publication: February 2008
In recent decades, qualitative approaches to probabilistic uncertainty have received more and more attention. We propose a characterisation of partial preference orders through a uniform axiomatic treatment of a variety of qualitative uncertainty notions. To this end, we prove a representation result that connects qualitative notions of partial uncertainty to their numerical counterparts. We describe an executable specification, in the declarative framework of Answer Set Programming, that constitutes the core engine for qualitative management of uncertainty. Some basic reasoning tasks are also identified.
The axiom of elementary sets on the edge of Peircean expressibility
Andrea Formisano, Eugenio G. Omodeo, Alberto Policriti
Journal: The Journal of Symbolic Logic / Volume 70 / Issue 3 / September 2005
Published online by Cambridge University Press: 12 March 2014, pp. 953-968
Being able to state the principles which lie deepest in the foundations of mathematics by sentences in three variables is crucially important for a satisfactory equational rendering of set theories along the lines proposed by Alfred Tarski and Steven Givant in their monograph of 1987.
The main achievement of this paper is the proof that the 'kernel' set theory whose postulates are extensionality. (E), and single-element adjunction and removal. (W) and (L), cannot be axiomatized by means of three-variable sentences. This highlights a sharp edge to be crossed in order to attain an 'algebraization' of Set Theory. Indeed, one easily shows that the theory which results from the said kernel by addition of the null set axiom, (N), is in its entirety expressible in three variables.