Sciweavers

247 search results - page 7 / 50
» Logic Programming Approach to Automata-Based Decision Proced...
Sort
View
LOPSTR
2004
Springer
15 years 3 months ago
On Termination of Binary CLP Programs
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
Alexander Serebrenik, Frédéric Mesna...
NMR
2004
Springer
15 years 3 months ago
A SAT-based polynomial space algorithm for answer set programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
AAAI
2004
14 years 11 months ago
SAT-Based Answer Set Programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
SYNASC
2005
IEEE
129views Algorithms» more  SYNASC 2005»
15 years 3 months ago
Logic Restructuring for Delay Balancing in Wave-Pipelined Circuits: An Integer Programming Approach
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
Srivastav Sethupathy, Nohpill Park, Marcin Paprzyc...
IANDC
2007
132views more  IANDC 2007»
14 years 9 months ago
An automata-theoretic approach to constraint LTL
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
Stéphane Demri, Deepak D'Souza