1,721,082 research outputs found
RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
No full text[No abstract available
17th RCRA international workshop on "Experimental evaluation of algorithms for solving problems with combinatorial explosion"
Full text link[No abstract available
18th RCRA international workshop on "experimental evaluation of algorithms for solving problems with combinatorial explosion"
No full text[No abstract available
RCRA 2007: Experimental evaluation of algorithms for solving problems with combinatorial explosion
No full text[No abstract available
Automated reasoning.
No full textKnowledge representation and automated reasoning are two of the pillars of Artificial Intelligence but, differently from
other pillars, they are strictly intertwined. Depending on how knowledge is represented, different types of reasoning can be applied
and, on the other hand, new developments in the automated reasoning column fosters new ideas on the knowledge representation
side. The Italian community has been always very involved in these fascinating themes, and this is witnessed by the lively group of
knowledge representation and automated reasoning (Rappresentazione della Conoscenza e Ragionamento Automatico, RCRA)
of AI*IA.
In this paper we survey the developments on automated reasoning in the last 25 years, with particular emphasis on the research
of the Italian community and of the RCRA group. The focus will be mainly on the algorithmic side, while a companion paper
focuses more on the knowledge representation side, and on the vast area of semantic technologies
Constraint Logic Programming
No full textConstraint Logic Programming (CLP) is one of the most successful branches of Logic Programming;
it attracts the interest of theoreticians and practitioners, and
it is currently used in many commercial applications.
Since the original proposal, it has developed enormously: many languages and systems are now
available either as open source programs
or as commercial systems.
Also, CLP has been one of the technologies
able to recruit researchers from other communities to the
declarative programming cause.
Current CLP engines include technologies and results
developed in other communities, which themselves discovered logic as an invaluable tool
to model and solve real-life problems
Evaluating Compliance: From LTL to Abductive Logic Programming
No full textThe compliance verification task amounts to establishing if the execution of a system, given in terms of observed happened events, does respect a given property. In the past both the frameworks of Temporal Logics and Logic Programming have been extensively exploited to assess compliance in different domains, such as normative multi-agent systems, business process management and service oriented computing.
In this work we review the LTL and SCIFF frameworks in the light of compliance evaluation, and formally investigate the relationship between the two approaches. We define a notion of compliance within each approach, and then we show that an arbitrary LTL formula can be expressed in SCIFF, by providing a translation procedure from LTL to SCIFF which preserves compliance
Declarative and Mathematical Programming approaches to Decision Support Systems for food recycling
Full text linkEvery year about one third of the food production intended for humans gets lost or wasted. This wastefulness of resources leads to the emission of unnecessary greenhouse gas, contributing to global warming and climate change.
The solution proposed by the SORT project is to “recycle” the surplus of food by reconditioning it into animal feed or fuel for biogas/biomass power plants. In order to maximize the earnings and minimize the costs, several choices must be made during the reconditioning process. Given the extremely complex nature of the process, Decision Support Systems (DSSs) could be helpful to reduce the human effort in decision making.
In this paper, we present a DSS for food recycling developed using two approaches for finding the optimal solution: one based on Binary Linear Programming (BLP) and the other based on Answer Set Programming (ASP), which outperform our previous approach based on Constraint Logic Programming (CLP) on Finite Domains (CLP(FD)).
In particular, the BLP and the CLP(FD) approaches are developed in ECLPS, a Prolog system that interfaces with various state-of-the-art Mathematical and Constraint Programming solvers. The ASP approach, instead, is developed in clingo. The three approaches are compared on several synthetic datasets that simulate the operative conditions of the DSS
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
