Sciweavers

977 search results - page 42 / 196
» Logic programming with infinite sets
Sort
View
AMAI
2006
Springer
15 years 13 days ago
Strong order equivalence
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
Wolfgang Faber, Kathrin Konczak
104
Voted
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 11 days ago
Propositional theories are strongly equivalent to logic programs
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
Pedro Cabalar, Paolo Ferraris
134
Voted
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 14 days ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
94
Voted
LPNMR
2007
Springer
15 years 6 months ago
GrinGo : A New Grounder for Answer Set Programming
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
Martin Gebser, Torsten Schaub, Sven Thiele
CORR
2011
Springer
180views Education» more  CORR 2011»
14 years 7 months ago
Representing First-Order Causal Theories by Logic Programs
Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner, became a basis for the semantics of several expressive action languages. McCain’s embedding of definit...
Paolo Ferraris, Joohyung Lee, Yuliya Lierler, Vlad...