no code implementations • 6 Sep 2024 • Mario Alviano, Laura Giordano, Daniele Theseider Dupré

In this paper we propose a many-valued temporal conditional logic.

1 code implementation • 30 Aug 2023 • Mario Alviano, Ly Ly Trieu, Tran Cao Son, Marcello Balduccini

Different from xASP, the new system, xASP2, supports different clingo constructs like the choice rules, the constraints, and the aggregates such as #sum, #min.

no code implementations • 12 Jul 2023 • Mario Alviano, Giovambattista Ianni, Francesco Pacenza, Jessica Zangari

In imperative programming, the Domain-Driven Design methodology helps in coping with the complexity of software development by materializing in code the invariants of a domain of interest.

no code implementations • 29 Apr 2023 • Mario Alviano, Francesco Bartoli, Marco Botta, Roberto Esposito, Laura Giordano, Daniele Theseider Dupré

In this paper we investigate the relationships between a multipreferential semantics for defeasible reasoning in knowledge representation and a multilayer neural network model.

1 code implementation • 8 Mar 2023 • Mario Alviano, Laura Giordano, Daniele Theseider Dupré

Weighted knowledge bases for description logics with typicality under a "concept-wise" multi-preferential semantics provide a logical interpretation of MultiLayer Perceptrons.

no code implementations • 14 Dec 2022 • Mario Alviano, Laura Giordano, Daniele Theseider Dupré

In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics.

no code implementations • 19 Feb 2022 • Mario Alviano, Carmine Dodaro, Arnel Zamayla

This paper formalizes the problem of data validation for ASP programs, introduces a language to specify data validation, and presents \textsc{valasp}, a tool to inject data validation in ordinary programs.

no code implementations • 17 Sep 2021 • Mario Alviano, Wolfgang Faber, Martin Gebser

Answer Set Programming (ASP) emerged in the late 1990ies as a paradigm for Knowledge Representation and Reasoning.

no code implementations • 7 Sep 2021 • Mario Alviano

The pyglaf reasoner takes advantage of circumscription to solve computational problems of abstract argumentation frameworks.

no code implementations • 9 Aug 2021 • Mario Alviano, Sotiris Batsakis, George Baryannis

In this work, we propose to use Answer Set Programming for implementing such constructions, and in particular for identifying the propositional atoms that are relevant in every world by means of a reachability relation.

1 code implementation • 4 Aug 2020 • George Baryannis, Ilias Tachmazidis, Sotiris Batsakis, Grigoris Antoniou, Mario Alviano, Emmanuel Papadakis

Even if a number of specialised qualitative reasoning tools have been developed so far, an important barrier to the wider adoption of these tools is that only qualitative reasoning is supported natively, when real-world problems most often require a combination of qualitative and other forms of reasoning.

no code implementations • 21 Mar 2020 • Mario Alviano, Marco Manna

Reasoning over OWL 2 is a very expensive task in general, and therefore the W3C identified tractable profiles exhibiting good computational properties.

no code implementations • 24 Jul 2019 • Mario Alviano, Carmine Dodaro, Johannes K. Fichte, Markus Hecher, Tobias Philipp, Jakob Rath

Verifying whether a claimed answer set is formally a correct answer set of the program can be decided in polynomial time for (normal) programs.

1 code implementation • 19 Jul 2019 • Mario Alviano, Nicola Leone, Pierfrancesco Veltri, Jessica Zangari

It turns out that the new version of magic sets is closed for Datalog programs with stratified negation and aggregations, which is very convenient to obtain efficient computation of the stable model of the rewritten program.

1 code implementation • 19 Apr 2018 • George Baryannis, Ilias Tachmazidis, Sotiris Batsakis, Grigoris Antoniou, Mario Alviano, Timos Sellis, Pei-Wei Tsai

In this work, we propose two versions of a trajectory calculus based on the allowed properties over trajectories, where trajectories are defined as a sequence of non-overlapping regions of a partitioned map.

no code implementations • 5 Jul 2017 • Mario Alviano

Many practical problems are characterized by a preference relation over admissible solutions, where preferred solutions are minimal in some sense.

no code implementations • 14 Jul 2015 • Mario Alviano, Wolfgang Faber, Martin Gebser

Since the evaluation of normal programs with monotone aggregates is in general on a lower complexity level than the evaluation of normal programs with arbitrary aggregates, any faithful translation function must introduce disjunction in rule heads in some cases.

no code implementations • 14 Jul 2015 • Mario Alviano, Rafael Penaloza

To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of

no code implementations • 14 Jul 2015 • Mario Alviano, Nicola Leone

Gelfond and Zhang recently proposed a new stable model semantics based on Vicious Circle Principle in order to improve the interpretation of logic programs with aggregates.

no code implementations • 14 May 2014 • Mario Alviano, Carmine Dodaro, Francesco Ricca

Query answering in Answer Set Programming (ASP) is usually solved by computing (a subset of) the cautious consequences of a logic program.

no code implementations • 6 May 2014 • Mario Alviano, Wolfgang Faber

Motivated by several examples, we argue that for some of the more intricate generalized atoms, the previously suggested semantics provide unintuitive results and provide an alternative semantics, which we call supportedly stable or SFLP answer sets.

no code implementations • 28 Apr 2014 • Mario Alviano, Carmine Dodaro, Francesco Ricca

This paper reports on the recent improvements of the ASP solver WASP.

no code implementations • 18 Jan 2014 • Mario Alviano, Francesco Calimeri, Wolfgang Faber, Nicola Leone, Simona Perri

As a consequence, a well-founded semantics for general LPA programs that allows for tractable computation is unlikely to exist, which justifies the restriction on LPAma programs.

no code implementations • 20 Dec 2013 • Mario Alviano, Wolfgang Faber

In this paper, we analyze the class of programs that have convex generalized atoms (originally proposed by Liu and Truszczynski in [10]) in rule bodies and show that for this class many of the proposed semantics coincide.

Cannot find the paper you are looking for? You can
Submit a new open access paper.

Contact us on:
hello@paperswithcode.com
.
Papers With Code is a free resource with all data licensed under CC-BY-SA.