Search Results for author:
Found 23 papers, 5 papers with code
Explanations for Answer Set Programming
Different from xASP, the new system, xASP2, supports different clingo constructs like the choice rules, the constraints, and the aggregates such as #sum, #min.
Rethinking Answer Set Programming Templates
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.
A preferential interpretation of MultiLayer Perceptrons in a conditional logic with typicality
In this paper we investigate the relationships between a multipreferential semantics for defeasible reasoning in knowledge representation and a multilayer neural network model.
Complexity and scalability of defeasible reasoning in many-valued weighted knowledge bases with typicality
Weighted knowledge bases for description logics with typicality under a "concept-wise" multi-preferential semantics provide a logical interpretation of MultiLayer Perceptrons.
Many-valued Argumentation, Conditionals and a Probabilistic Semantics for Gradual Argumentation
In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics.
ValAsp: a tool for data validation in Answer Set Programming
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.
Aggregate Semantics for Propositional Answer Set Programs
Answer Set Programming (ASP) emerged in the late 1990ies as a paradigm for Knowledge Representation and Reasoning.
The pyglaf argumentation reasoner (ICCMA2021)
The pyglaf reasoner takes advantage of circumscription to solve computational problems of abstract argumentation frameworks.
Modal Logic S5 Satisfiability in Answer Set Programming
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.
A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming
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.
Large-scale Ontological Reasoning via Datalog
Reasoning over OWL 2 is a very expensive task in general, and therefore the W3C identified tractable profiles exhibiting good computational properties.
Inconsistency Proofs for ASP: The ASP-DRUPE Format
Verifying whether a claimed answer set is formally a correct answer set of the program can be decided in polynomial time for (normal) programs.
Enhancing magic sets with an application to ontological reasoning
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.
A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming
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.
Model enumeration in propositional circumscription via unsatisfiable core analysis
Many practical problems are characterized by a preference relation over admissible solutions, where preferred solutions are minimal in some sense.
Rewriting recursive aggregates in answer set programming: back to monotonicity
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.
Complexity and Compilation of GZ-Aggregates in Answer Set Programming
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.
Fuzzy Answer Set Computation via Satisfiability Modulo Theories
To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of
Anytime Computation of Cautious Consequences in Answer Set Programming
Query answering in Answer Set Programming (ASP) is usually solved by computing (a subset of) the cautious consequences of a logic program.
Semantics and Compilation of Answer Set Programming with Generalized Atoms
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.
Preliminary Report on WASP 2.0
This paper reports on the recent improvements of the ASP solver WASP.
Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates
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.
Properties of Answer Set Programming with Convex Generalized Atoms
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.
