Sciweavers

AAAI
2004
14 years 28 days 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
NMR
2004
Springer
14 years 4 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
ICCSA
2004
Springer
14 years 4 months ago
A Reduced Codification for the Logical Representation of Job Shop Scheduling Problems
Abstract. This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not...
Juan Frausto Solís, Marco Antonio Cruz-Chav...
DAC
2001
ACM
15 years 14 days ago
Dynamic Detection and Removal of Inactive Clauses in SAT with Application in Image Computation
In this paper, we present a new technique for the e cient dynamic detection and removal of inactive clauses, i.e. clauses that do not a ect the solutions of interest of a Boolean ...
Aarti Gupta, Anubhav Gupta, Zijiang Yang, Pranav A...