Share This Author
Combining answer set programming with description logics for the Semantic Web
On properties of update sequences based on causal rejection
- Thomas Eiter, Michael Fink, Giuliana Sabbatini, H. Tompits
- Computer ScienceTheory and Practice of Logic Programming
- 5 September 2001
The current approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics is shown to be semantically equivalent to inheritance programs, which have been independently defined by Buccafurri et al., and to certain classes of dynamic logic programs.
A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming
HEX programs are introduced, which are nonmonotonic logic programs admitting higher-order atoms as well as external atoms, and the well-known answer-set semantics are extended to this class of programs.
A framework for compiling preferences in logic programs
- J. Delgrande, Torsten Schaub, H. Tompits
- Computer Science, EconomicsTheory and Practice of Logic Programming
- 4 March 2002
A methodology and framework for expressing general preference information in logic programming under the answer set semantics, and develops a specific approach to reasoning with preferences, wherein the preference ordering specifies the order in which rules are to be applied.
Comparing Different Prenexing Strategies for Quantified Boolean Formulas
Experimental results show that different prenexing strategies influence the evaluation time in different ways across different solvers, in particular, some solvers are robust to the chosen strategies while others are not.
Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning
A general method for combining and evaluating sub-programs belonging to arbitrary classes is introduced, thus enlarging the variety of programs whose execution is practicable and keeping the desirable advantages of the full language.
A Meta-Programming Technique for Debugging Answer-Set Programs
This paper introduces a meta-programming technique for debugging in ASP that respects the declarative nature of ASP, and the capabilities of the system can easily be extended to incorporate differing debugging features.
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
The method to implement equilibrium logic and stable models for logic programs with nested expressions, based on polynomial reductions to quantified Boolean formulas (QBFs), yields a practically relevant approach to rapid prototyping.
A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning
An overview and classification for approaches to dealing with preference is presented, followed by a set of desiderata that an approach might be expected to satisfy.
Debugging ASP Programs by Means of ASP
- M. Brain, M. Gebser, Jörg Pührer, Torsten Schaub, H. Tompits, S. Woltran
- Computer ScienceLPNMR
- 15 May 2007
This paper proposes a novel methodology, which rests within ASP itself, to sort out errors on the conceptual level, which makes use of tagging, where the program to be analyzed is rewritten using dedicated control atoms.