output
20022015
most citedAtom Interferometers

1.4k citations

Showing 2010 · cs.LOShow all

8 papers · 2 filters

cs.LO20101 cited

Termination of Rewriting with and Automated Synthesis of Forbidden Patterns

Bernhard Gramlich, Felix Schernhammer

We introduce a modified version of the well-known dependency pair framework that is suitable for the termination analysis of rewriting under forbidden pattern restrictions. By atta…

cs.LO20101 cited

An Optimization for Reasoning with Forest Logic Programs

Cristina Feier, Stijn Heymans

Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg…

cs.LO2010

Reformulation of Global Constraints in Answer Set Programming

Christian Drescher, Toby Walsh

We show that global constraints on finite domains like all-different can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reformu…

cs.LO20109 cited

The System Kato: Detecting Cases of Plagiarism for Answer-Set Programs

Johannes Oetsch, Jörg Pührer, Martin Schwengerer +1

Plagiarism detection is a growing need among educational institutions and solutions for different purposes exist. An important field in this direction is detecting cases of source-…

cs.LO20102 cited

A Translational Approach to Constraint Answer Set Solving

Christian Drescher, Toby Walsh

We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in A…

cs.LO20107 cited

Automatic Generation of Proof Tactics for Finite-Valued Logics

João Marcos

A number of flexible tactic-based logical frameworks are nowadays available that can implement a wide range of mathematical theories using a common higher-order metalanguage. Used…