Sciweavers

934 search results - page 35 / 187
» Elementary Sets of Logic Programs
Sort
View
FASE
2011
Springer
14 years 1 months ago
Testing Container Classes: Random or Systematic?
Abstract. Container classes such as lists, sets, or maps are elementary data structures common to many programming languages. Since they are a part of standard libraries, they are ...
Rohan Sharma, Milos Gligoric, Andrea Arcuri, Gordo...
CORR
2010
Springer
180views Education» more  CORR 2010»
14 years 10 months ago
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
Zachary Snow, David Baelde, Gopalan Nadathur
AMAI
2006
Springer
14 years 10 months 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
CORR
2007
Springer
98views Education» more  CORR 2007»
14 years 9 months 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
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 10 months 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...