Search Results for author:
Found 15 papers, 2 papers with code
Evaluating Datalog Tools for Meta-reasoning over OWL 2 QL
This paper deals with the Metamodeling Semantics (MS) over OWL 2 QL and the Metamodeling Semantic Entailment Regime (MSER), as proposed in Lenzerini et al. (2015) and Lenzerini et al. (2020); Cima et al. (2017).
An efficient solver for ASP(Q)
In this paper, we present a new implementation that builds on the ideas of qasp and features both a more efficient encoding procedure and new optimized encodings of ASP(Q) programs in QBF.
Aggregate Semantics for Propositional Answer Set Programs
Answer Set Programming (ASP) emerged in the late 1990ies as a paradigm for Knowledge Representation and Reasoning.
Thirty years of Epistemic Specifications
The language of epistemic specifications and epistemic logic programs extends disjunctive logic programs under the stable model semantics with modal constructs called subjective literals.
Determining ActionReversibility in STRIPS Using Answer Set and Epistemic Logic Programming
In particular, we leverage an existing translation from PDDL to Answer Set Programming (ASP), and then use several different encodings to tackle the problem of action reversibility for the STRIPS fragment of PDDL.
ASP-Core-2 Input Language Format
Standardization of solver input languages has been a main driver for the growth of several areas within knowledge representation and reasoning, fostering the exploitation in actual applications.
On Uniform Equivalence of Epistemic Logic Programs
Epistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with epistemic negation and have received renewed interest in recent years.
On the Computation of Paracoherent Answer Sets
Answer Set Programming (ASP) is a well-established formalism for nonmonotonic reasoning.
Solving Set Optimization Problems by Cardinality Optimization via Weak Constraints with an Application to Argumentation
Optimization - minimization or maximization - in the lattice of subsets is a frequent operation in Artificial Intelligence tasks.
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.
Efficient Computation of the Well-Founded Semantics over Big Data
Data originating from the Web, sensor readings and social media result in increasingly huge datasets.
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.
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.
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.
