Sciweavers

413 search results - page 22 / 83
» On the Relation Between ID-Logic and Answer Set Programming
Sort
View
AICOM
2006
129views more  AICOM 2006»
13 years 9 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone
LOPSTR
2004
Springer
14 years 2 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
CSL
2004
Springer
14 years 2 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 9 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
SLE
2009
Springer
14 years 1 months ago
Closing the Gap between Modelling and Java
Abstract. Model-Driven Software Development is based on standardised models that are refined, transformed and eventually translated into executable code using code generators. How...
Florian Heidenreich, Jendrik Johannes, Mirko Seife...