Sciweavers

192 search results - page 19 / 39
» Considerations on Updates of Logic Programs
Sort
View
PPDP
2009
Springer
14 years 3 months ago
A declarative encoding of telecommunications feature subscription in SAT
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
Michael Codish, Samir Genaim, Peter J. Stuckey
SAT
2005
Springer
104views Hardware» more  SAT 2005»
14 years 2 months ago
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
Marijn Heule, Hans van Maaren
MST
2008
141views more  MST 2008»
13 years 8 months ago
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
VLDB
1990
ACM
143views Database» more  VLDB 1990»
14 years 19 days ago
Synthesizing Database Transactions
Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated programming ...
Xiaolei Qian
PPDP
2007
Springer
14 years 2 months ago
Mechanized metatheory model-checking
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
James Cheney, Alberto Momigliano