Author image not provided
 Andrea Formisano

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article3.77
Citation Count113
Publication count30
Publication years1997-2017
Available for download3
Average downloads per article100.33
Downloads (cumulative)301
Downloads (12 Months)67
Downloads (6 Weeks)32
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


31 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 31
Result page: 1 2

Sort by:

1
September 2018 Declarative Logic Programming: Theory, Systems, and Applications
Publisher: Association for Computing Machinery and Morgan & Claypool
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 26,   Downloads (12 Months): 26,   Downloads (Overall): 26

Full text available: PDFPDF
This chapter provides a broad overview of howlogic programming, and more specifically Answer Set Programming (ASP), can be used to model and solve some popular and challenging classes of problems in the general domain of bioinformatics. In particular, the chapter explores the use of ASP in Genomics studies, such as ...

2 published by ACM
November 2017 IA3'17: Proceedings of the Seventh Workshop on Irregular Applications: Architectures and Algorithms
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 16,   Downloads (12 Months): 16,   Downloads (Overall): 16

Full text available: PDFPDF
Quantitative games, where quantitative objectives are defined on weighted game arenas, provide natural tools for designing faithful models of embedded controllers. Instances of these games are the so called Energy Games. Starting from a sequential baseline implementation, we investigate the use of massively data computation capabilities supported by modern GPUs ...
Keywords: CUDA, GPU-computing, Energy games

3
May 2016 Theoretical Computer Science: Volume 629 Issue C, May 2016
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0


4
May 2016 AAMAS '16: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems
Publisher: International Foundation for Autonomous Agents and Multiagent Systems
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 7,   Downloads (Overall): 7

Full text available: PDFPDF
In this paper we consider the software-engineering problem of how to empower modular agent architectures with the capability to perform quantitative reasoning in a uniform and principled way.
Keywords: agent-oriented software engineering, quantitative reasoning, multi-context systems

5
October 2013 Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011: Volume 124 Issue 4, October 2013
Publisher: IOS Press
Bibliometrics:
Citation Count: 1

Product configuration systems are an emerging technology that supports companies in deploying mass customization strategies. Such strategies need to cover the management of the whole customizable product cycle. Adding process modeling and configuration features to a product configurator may improve its ability to assist mass customization development. In this paper, ...
Keywords: Product And Process Modeling Languages, Configuration Of Product/Process Models

6
October 2013 Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011: Volume 124 Issue 4, October 2013
Publisher: IOS Press
Bibliometrics:
Citation Count: 0

Weight constraints are a powerful programming construct that has proved very useful within the Answer Set Programming paradigm. In this paper, we argue that practical Answer Set Programming might take profit from introducing some forms of nested weight constraints. We define such empowered constraints that we call “Nested Weight Constraints” ...
Keywords: Non-Monotonic Reasoning, Weight Constraints In Asp, Knowledge Representation

7
September 2013 LPNMR 2013: Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning - Volume 8148
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

In recent work, we provided a formulation of ASP programs in terms of linear logic theories. Based on this work, in this paper we propose and discuss a modified Answer Set Semantics, "Resource-based Answer Set Semantics".
Keywords: Answer Set Programming, Default Negation, Linear Logic

8
July 2012 Journal of Discrete Algorithms: Volume 14, July, 2012
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

When the environment does not allow direct access to disseminated data, a sensor network could be one of the most appropriate solutions to retrieve the map of interesting areas. Based on existing approaches, we start our study from the standard random deployment of a sensor network and then we consider ...
Keywords: Collision, Routing, Coloring, Wireless sensor networks

9
January 2012 Correct Reasoning: essays on logic-based AI in honor of Vladimir Lifschitz
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

RASP is a recent extension of Answer Set Programming (ASP) that permits declarative specification and reasoning on consumption and production of resources. In this paper, we extend the concept of strong equivalence (which, as widely recognized, provides an important conceptual and practical tool for program simplification, transformation and optimization) from ...

10
May 2011 LPNMR'11: Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

Weight and cardinality constraints constitute a very useful programming construct widely adopted in Answer Set Programming (ASP). In recent work we have proposed RASP, an extension to plain ASP where complex forms of preferences can be flexibly expressed. In this paper, we illustrate an application of these preferences within weight/cardinality ...

11
January 2011 Logic programming, knowledge representation, and nonmonotonic reasoning: essays dedicated to Michael Gelfond on the occasion of his 65th birthday
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

Action languages have gained popularity as a means for declaratively describing planning domains. This paper overviews two action languages, the Boolean language B and its multi-valued counterpart B MV . The paper analyzes some of the issues in using two alternative logic programming approaches (Answer Set Programming and Constraint Logic ...

12
April 2010 Journal of Logic and Computation: Volume 20 Issue 2, April 2010
Publisher: Oxford University Press
Bibliometrics:
Citation Count: 7

In this article, we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension RASP, standing for ‘Resourced ASP’. Resources are modeled by introducing special atoms, called amount-atoms , to which we associate quantities that represent the ...

13
January 2010 A 25-year perspective on logic programming: achievements of the Italian association for logic programming, GULP
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

In designing a large-scale computerized proof system, one is often confronted with issues of two kinds: issues regarding an underlying logical calculus, and issues that refer to theories, either specified axiomatically or characterized by indication of either a privileged model or a family of intended models. Proof services related to ...
Keywords: set Theory, decision algorithm, inference mechanism, proof assistant

14
January 2010 Fundamenta Informaticae - On the Italian Conference on Computational Logic: CILC 2009: Volume 105 Issue 1-2, January 2010
Publisher: IOS Press
Bibliometrics:
Citation Count: 3

This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning problems in the presence of multiple interacting agents. The paper develops a novel constraint-based action language, ℬ MAP , that enables the declarative description of large classes of multi-agent and multi-valued domains. ℬ ...
Keywords: Constraint Logic Programming, Multi Agent Planning, Action Description Languages

15
January 2010 Fundamenta Informaticae - On the Italian Conference on Computational Logic: CILC 2009: Volume 105 Issue 1-2, January 2010
Publisher: IOS Press
Bibliometrics:
Citation Count: 8

In previous work we have proposed an extension to ASP (Answer Set Programming), called RASP, standing for ASP with Resources. RASP supports declarative reasoning on production and consumption of (amounts of) resources. The approach combines answer set semantics with quantitative reasoning and relies on an algebraic structure to support computations ...
Keywords: language extensions, preferences, Answer set programming, quantitative reasoning

16
September 2009 LPNMR '09: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We explore the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning domains in presence of multiple interacting agents. We develop a novel <em>constraint-based</em> action language, $\mathcal{B}^{\sf MAP}$, that enables the declarative description of large classes of multi-agent and multi-valued domains. $\mathcal{B}^{\sf MAP}$ supports several complex ...

17
June 2009 Journal of Experimental & Theoretical Artificial Intelligence: Volume 21 Issue 2, June 2009
Publisher: Taylor & Francis, Inc.
Bibliometrics:
Citation Count: 8

This paper presents experimental comparisons between the declarative encodings of various computationally hard problems in Answer Set Programming (ASP) and Constraint Logic Programming over Finite Domains (CLP(FD)). The objective is to investigate how solvers in the two domains respond to different problems, highlighting the strengths and weaknesses of their implementations, ...
Keywords: constraint solving, logic programming, combinatorial problems

18
January 2009 Journal of Algorithms: Volume 64 Issue 1, January, 2009
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 10

In this paper, we extend our previous work on Resourced ASP, or for short RASP, where we have introduced the possibility of defining and using resources in ASP. In RASP, one can define resources with their amounts, where available resources can be used for producing other resources and the remaining ...
Keywords: Preferences, Answer set programming, Quantitative reasoning, Language extensions, Non-monotonic logic programming

19
February 2008 Mathematical Structures in Computer Science: Volume 18 Issue 1, February 2008
Publisher: Cambridge University Press
Bibliometrics:
Citation Count: 2

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 ...

20
September 2007 ICLP'07: Proceedings of the 23rd international conference on Logic programming
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 9

Action description languages, such as A and B [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a methodology to encode an action language (with conditional effects and static causal laws), a slight variation of B , using Constraint Logic Programming over Finite ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us