16 citations · 71 across the 26 of their papers we have counts for
31 papers
Logic-Guided Data Extraction with Answer Set Programming and Large Language Models
Mario Alviano, Lorenzo Grillo, Nicola Leone +1
When Large Language Models (LLMs) are used for semantic data extraction from unstructured text, producing candidate relational facts from natural language, they may remain unreliab…
Explanations for Answer Set Programming
Mario Alviano, Ly Ly Trieu, Tran Cao Son +1
The paper presents an enhancement of xASP, a system that generates explanation graphs for Answer Set Programming (ASP). Different from xASP, the new system, xASP2, supports differe…
Rethinking Answer Set Programming Templates
Mario Alviano, Giovambattista Ianni, Francesco Pacenza +1
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 i…
A preferential interpretation of MultiLayer Perceptrons in a conditional logic with typicality
Mario Alviano, Francesco Bartoli, Marco Botta +3
In this paper we investigate the relationships between a multipreferential semantics for defeasible reasoning in knowledge representation and a multilayer neural network model. Wei…
Complexity and scalability of defeasible reasoning in many-valued weighted knowledge bases with typicality
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. In t…
Many-valued Argumentation, Conditionals and a Probabilistic Semantics for Gradual Argumentation
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. The approach allows for conditional reasoning ov…
Generative Datalog with Stable Negation
Mario Alviano, Matthias Lanzinger, Michael Morak +1
Extending programming languages with stochastic behaviour such as probabilistic choices or random sampling has a long tradition in computer science. A recent development in this di…
ValAsp: a tool for data validation in Answer Set Programming
Mario Alviano, Carmine Dodaro, Arnel Zamayla
The development of complex software requires tools promoting fail-fast approaches, so that bugs and unexpected behavior can be quickly identified and fixed. Tools for data validati…
Aggregate Semantics for Propositional Answer Set Programs
Mario Alviano, Wolfgang Faber, Martin Gebser
Answer Set Programming (ASP) emerged in the late 1990ies as a paradigm for Knowledge Representation and Reasoning. The attractiveness of ASP builds on an expressive high-level mode…
The pyglaf argumentation reasoner (ICCMA2021)
Mario Alviano
The pyglaf reasoner takes advantage of circumscription to solve computational problems of abstract argumentation frameworks. In fact, many of these problems are reduced to circumsc…
Modal Logic S5 Satisfiability in Answer Set Programming
Mario Alviano, Sotiris Batsakis, George Baryannis
Modal logic S5 has attracted significant attention and has led to several practical applications, owing to its simplified approach to dealing with nesting modal operators. Efficien…
A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming
George Baryannis, Ilias Tachmazidis, Sotiris Batsakis +3
Qualitative reasoning involves expressing and deriving knowledge based on qualitative terms such as natural language expressions, rather than strict mathematical quantities. Well o…
Large-scale Ontological Reasoning via Datalog
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. Ontological reasoning for ma…
Inconsistency Proofs for ASP: The ASP-DRUPE Format
Mario Alviano, Carmine Dodaro, Johannes K. Fichte +3
Answer Set Programming (ASP) solvers are highly-tuned and complex procedures that implicitly solve the consistency problem, i.e., deciding whether a logic program admits an answer…
Enhancing magic sets with an application to ontological reasoning
Mario Alviano, Nicola Leone, Pierfrancesco Veltri +1
Magic sets are a Datalog to Datalog rewriting technique to optimize query answering. The rewritten program focuses on a portion of the stable model(s) of the input program which is…
Shared aggregate sets in answer set programming
Mario Alviano, Carmine Dodaro, Marco Maratea
Aggregates are among the most frequently used linguistic extensions of answer set programming. The result of an aggregation may introduce new constants during the instantiation of…
Cautious reasoning in ASP via minimal models and unsatisfiable cores
Mario Alviano, Carmine Dodaro, Matti Järvisalo +2
Answer Set Programming (ASP) is a logic-based knowledge representation framework, supporting---among other reasoning modes---the central task of query answering. In the proposition…
A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming
George Baryannis, Ilias Tachmazidis, Sotiris Batsakis +4
Spatial information is often expressed using qualitative terms such as natural language expressions instead of coordinates; reasoning over such terms has several practical applicat…
Model enumeration in propositional circumscription via unsatisfiable core analysis
Mario Alviano
Many practical problems are characterized by a preference relation over admissible solutions, where preferred solutions are minimal in some sense. For example, a preferred diagnosi…
Anytime answer set optimization via unsatisfiable core shrinking
Mario Alviano, Carmine Dodaro
Unsatisfiable core analysis can boost the computation of optimum stable models for logic programs with weak constraints. However, current solvers employing unsatisfiable core analy…
Fuzzy Answer Set Computation via Satisfiability Modulo Theories
Mario Alviano, Rafael Penaloza
Fuzzy answer set programming (FASP) combines two declarative frameworks, answer set programming and fuzzy logic, in order to model reasoning by default over imprecise information.…
Semantics and Compilation of Answer Set Programming with Generalized Atoms
Mario Alviano, Wolfgang Faber
Answer Set Programming (ASP) is logic programming under the stable model or answer set semantics. During the last decade, this paradigm has seen several extensions by generalizing…
Anytime Computation of Cautious Consequences in Answer Set Programming
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. This task is computationally very hard, a…
Preliminary Report on WASP 2.0
Mario Alviano, Carmine Dodaro, Francesco Ricca
Answer Set Programming (ASP) is a declarative programming paradigm. The intrinsic complexity of the evaluation of ASP programs makes the development of more effective and faster sy…