Search Results for author:
Found 22 papers, 2 papers with code
Deontic Paradoxes in ASP with Weak Constraints
The rise of powerful AI technology for a range of applications that are sensitive to legal, social, and ethical norms demands decision-making support in presence of norms and regulations.
Contextual Reasoning for Scene Generation (Technical Report)
In this paper, we show how to apply our theoretical work to real autonomous-vehicle scene data.
Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling
We study the application of Answer-Set Programming (ASP) to solve this problem.
A Neuro-Symbolic ASP Pipeline for Visual Question Answering
Our pipeline covers (i) training neural networks for object classification and bounding-box prediction of the CLEVR scenes, (ii) statistical analysis on the distribution of prediction values of the neural networks to determine a threshold for high-confidence predictions, and (iii) a translation of CLEVR questions and network predictions that pass confidence thresholds into logic programs so that we can compute the answers using an ASP solver.
Chasing Streams with Existential Rules
We study reasoning with existential rules to perform query answering over streams of data.
CQELS 2.0: Towards A Unified Framework for Semantic Stream Fusion
We present CQELS 2. 0, the second version of Continuous Query Evaluation over Linked Streams.
A Confidence-Based Interface for Neuro-Symbolic Visual Question Answering
We present a neuro-symbolic visual question answering (VQA) approach for the CLEVR dataset that is based on the combination of deep neural networks and answer-set programming (ASP), a logic-based paradigm for declarative problem solving.
Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures
In this paper, we overcome these limitations and present a generalization of CKR hierarchies to multiple contextual relations, along with their interpretation of defeasible axioms and preference.
Reasoning on $\textit{DL-Lite}_{\cal R}$ with Defeasibility in ASP
In this direction, in our previous works we presented a framework for representing (contextualized) OWL RL knowledge bases with a notion of justified exceptions on defeasible axioms: reasoning in such framework is realized by a translation into ASP programs.
Constraint Monotonicity, Epistemic Splitting and Foundedness Could in General Be Too Strong in Answer Set Programming
Recently, the notions of subjective constraint monotonicity, epistemic splitting, and foundedness have been introduced for epistemic logic programs, with the aim to use them as main criteria respectively intuitions to compare different answer set semantics proposed in the literature on how they comply with these intuitions.
ASP(AC): Answer Set Programming with Algebraic Constraints
Using a novel combination of Weighted Logic and Here-and-There (HT) Logic, in which this dependence is based on intuitionistic grounds, we introduce Answer Set Programming with Algebraic Constraints (ASP(AC)), where rules may contain constraints that compare semiring values to weighted formula evaluations.
Managing caching strategies for stream reasoning with reinforcement learning
In particular, we study the applicability of reinforcement learning to continuously assess the utility of learned constraints computed in previous invocations of the solving algorithm for the current one.
Abstraction for Zooming-In to Unsolvability Reasons of Grid-Cell Problems
Humans are capable of abstracting away irrelevant details when studying problems.
A Distributed Approach to LARS Stream Reasoning (System paper)
Modern approaches to stream reasoning are usually performing their computations using stand-alone solvers, which incrementally update their internal state and return results as the new portions of data streams are pushed.
A Note on Reasoning on $\textit{DL-Lite}_{\cal R}$ with Defeasibility
Representation of defeasible information is of interest in description logics, as it is related to the need of accommodating exceptional instances in knowledge bases.
Towards Abstraction in ASP with an Application on Reasoning about Agent Policies
ASP programs are a convenient tool for problem solving, whereas with large problem instances the size of the state space can be prohibitive.
Reasoning with Justifiable Exceptions in Contextual Hierarchies (Appendix)
This paper is an appendix to the paper "Reasoning with Justifiable Exceptions in Contextual Hierarchies" by Bozzato, Serafini and Eiter, 2018.
Stream Reasoning-Based Control of Caching Strategies in CCN Routers
Content-Centric Networking (CCN) research addresses the mismatch between the modern usage of the Internet and its outdated architecture.
Reactive Policies with Planning for Action Languages
We describe a representation in a high-level transition system for policies that express a reactive behavior for the agent.
A model building framework for Answer Set Programming with external computations
As software systems are getting increasingly connected, there is a need for equipping nonmonotonic logic programs with access to external sources that are possibly remote and may contain information in heterogeneous formats.
Towards Ideal Semantics for Analyzing Stream Reasoning
The rise of smart applications has drawn interest to logical reasoning over data streams.
The DLV System for Knowledge Representation and Reasoning
As for problem solving, we provide a formal definition of its kernel language, function-free disjunctive logic programs (also known as disjunctive datalog), extended by weak constraints, which are a powerful tool to express optimization problems.
