no code implementations • 5 Feb 2024 • Haya Majid Qureshi, Wolfgang Faber
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).
1 code implementation • 17 May 2023 • Wolfgang Faber, Giuseppe Mazzotta, Francesco Ricca
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.
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 • 17 Aug 2021 • Jorge Fandinno, Wolfgang Faber, Michael Gelfond
The language of epistemic specifications and epistemic logic programs extends disjunctive logic programs under the stable model semantics with modal constructs called subjective literals.
no code implementations • 11 Aug 2021 • Wolfgang Faber, Michael Morak, Lukáš Chrpa
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.
1 code implementation • 11 Nov 2019 • Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista Ianni, Roland Kaminski, Thomas Krennwallner, Nicola Leone, Marco Maratea, Francesco Ricca, Torsten Schaub
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.
no code implementations • 25 Jul 2019 • Wolfgang Faber, Michael Morak, Stefan Woltran
Epistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with epistemic negation and have received renewed interest in recent years.
no code implementations • 21 Jul 2017 • Giovanni Amendola, Carmine Dodaro, Wolfgang Faber, Nicola Leone, Francesco Ricca
Answer Set Programming (ASP) is a well-established formalism for nonmonotonic reasoning.
no code implementations • 22 Dec 2016 • Wolfgang Faber, Mauro Vallati, Federico Cerutti, Massimiliano Giacomin
Optimization - minimization or maximization - in the lattice of subsets is a frequent operation in Artificial Intelligence tasks.
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 • 11 May 2014 • Ilias Tachmazidis, Grigoris Antoniou, Wolfgang Faber
Data originating from the Web, sensor readings and social media result in increasingly huge datasets.
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 • 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.
no code implementations • 4 Nov 2002 • Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello
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.