Sciweavers

934 search results - page 4 / 187
» Elementary Sets of Logic Programs
Sort
View
AAAI
2012
11 years 9 months ago
Reformulating Temporal Action Logics in Answer Set Programming
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...
Joohyung Lee, Ravi Palla
ASP
2001
Springer
13 years 11 months ago
Learning by Answer Sets
This paper presents a novel application of answer set programming to concept learning in nonmonotonic logic programs. Given an extended logic program as a background theory, we in...
Chiaki Sakama
ISMVL
2008
IEEE
160views Hardware» more  ISMVL 2008»
14 years 1 months ago
Exact Synthesis of Elementary Quantum Gate Circuits for Reversible Functions with Don't Cares
Compact realizations of reversible logic functions are of interest in the design of quantum computers. In this paper we present an exact synthesis algorithm, based on Boolean Sati...
Daniel Große, Robert Wille, Gerhard W. Dueck...
PPDP
2009
Springer
14 years 1 months ago
An embedded declarative data transformation language
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
Paul Tarau
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 7 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard