gkatsi's sat [16 articles] Export

Recent papers added to gkatsi's library classified by the tag sat. You can also see everyone's sat.

	Why Cumulative Decomposition Is Not as Bad as It Sounds [My Copy] Principles and Practice of Constraint Programming - CP 2009 (2009), pp. 746-761. by Andreas Schutt, Thibaut Feydy, Peter Stuckey, Mark Wallace posted to sat jsp by gkatsi on 2009-11-07 19:49:33 as
	A Decision-Making Procedure for Resolution-Based SAT-Solvers [My Copy] Theory and Applications of Satisfiability Testing – SAT 2008 (2008), pp. 119-132. by Eugene Goldberg posted to sat local-search hybrid cdcl by gkatsi on 2009-11-07 19:46:54 as
	PicoSAT Essentials [My Copy] Journal on Satisfiability, Boolean Modeling and Computation, Vol. 4, No. 2-4. (2008), pp. 75-97. by Armin Biere posted to sat dpll by gkatsi on 2009-10-26 17:50:19 as
	Multi-resolution on compressed sets of clauses [My Copy] Tools with Artificial Intelligence, 2000. ICTAI 2000. Proceedings. 12th IEEE International Conference on (06 August 2002), pp. 2-10. by P. Chatalic, L. Simon posted to sat resolution bdd by gkatsi on 2009-10-19 14:56:27 as
	Efficient conflict driven learning in a boolean satisfiability solver [My Copy] In In ICCAD (2001), pp. 279-285. by Lintao Zhang, Conor F. Madigan posted to sat resolution cdcl by gkatsi on 2009-09-30 13:18:59 as along with 2 people radsz pwais
	Analyzing Context-Free Grammars Using an Incremental SAT Solver [My Copy] Automata, Languages and Programming (2008), pp. 410-422. by Roland Axelsson, Keijo Heljanko, Martin Lange posted to grammar sat by gkatsi on 2009-08-09 18:51:50 as
	A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances [My Copy] In Proceedings of the Eighth Symposium on Abstraction, Reformulation and Approximation, (SARA'2009) by Philippe Jegou, Lionel Paris posted to sat tractable by gkatsi on 2009-07-29 14:47:55 as
	Solving Difficult SAT Instances Using Greedy Clique Decomposition [My Copy] Abstraction, Reformulation, and Approximation (2007), pp. 359-374. by Pavel Surynek posted to clique sat by gkatsi on 2009-07-29 12:50:21 as
	The complexity of satisfiability problems [My Copy] In STOC '78: Proceedings of the tenth annual ACM symposium on Theory of computing (1978), pp. 216-226. by Thomas J. Schaefer posted to horn sat tractable by gkatsi on 2009-07-27 20:21:11 as
	On the Complexity of SAT [My Copy] In FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (1999), 459. by Richard J. Lipton, Anastasios Viglas posted to sat by gkatsi on 2009-07-21 17:56:59 as
	Local Search for Unsatisfiability [My Copy] Theory and Applications of Satisfiability Testing - SAT 2006 (2006), pp. 283-296. by Steven Prestwich, Inês Lynce posted to sat resolution by gkatsi on 2009-07-20 19:28:35 as
	Analytic and Algorithmic Solution of Random Satisfiability Problems [My Copy] Science, Vol. 297, No. 5582. (2 August 2002), pp. 812-815. by M. Mezard, G. Parisi, R. Zecchina posted to sat survey-propagation by gkatsi on 2009-03-05 01:10:48 as along with 2 people davidecellai jcvasquezb106
	Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution [My Copy] Theory and Applications of Satisfiability Testing (2004), pp. 337-339. by Maher Mneimneh, Karem Sakallah posted to qbf sat by gkatsi on 2009-01-20 06:43:51 as
	Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers [My Copy] In SAT, Vol. 2919 (2004) edited by Enrico Giunchiglia, Armando Tacchella posted to cnf-decomposition consistency sat by gkatsi on 2009-01-12 08:56:46 as
	Local Consistencies in SAT [My Copy] In SAT, Vol. 2919 (2003), pp. 299-314. by Christian Bessière, Emmanuel Hebrard, Toby Walsh edited by Enrico Giunchiglia, Armando Tacchella posted to cnf-decomposition consistency sat by gkatsi on 2009-01-12 08:56:46 as
	Towards understanding and harnessing the potential of clause learning [My Copy] Journal of Artificial Intelligence Research, Vol. 22 (2004), pp. 319-351. by P. Beame, H. Kautz, A. Sabharwal posted to sat resolution proof-complexity dpll cdcl by gkatsi on 2008-08-04 08:24:52 as

Note: You may cite this page as: http://www.citeulike.org/user/gkatsi/tag/sat

file-import-08-08-04	535
resolution	28
global-constraints	17
sat	16
qbf	14
dpll	10
proof-complexity	10
propagation	8
automata	8
symmetry-breaking	7
grammar	7
gacschema	7
tractable	5
local-search	5
compression	5
sequence	4
cdcl	4
soft-constraints	4
extended-resolution	4
gac	4
survey-propagation	4
cnf-decomposition	4
consistency	3
regular	3
decomposition	3
decision-trees	3
cnf	3
alldifferent	3
bdd	3
experimental	3
k-dnf-resolution	2
circuits	2
symmetry	2
atms	2
xor	2
nvalue	2
minimization	2
smt	2
acyclicity	2
counting	2
subsumption	2
softgcc	2
set-variables	2
modeling	2
monotone-complexity	2
circuit-complexity	2
formula-caching	1
hybrid	1
dnf	1
integer-programming	1
pigeonhole-principle	1
matching	1
clique	1
linear	1
information-theory	1
temporal	1
restarts	1
ac	1
multiset-variables	1
tree	1
fpt	1
softalldiff	1
boolean-functions	1
cryptography	1
subgraph-isomorphism	1
propositional_calculus	1
databases	1
treewidth	1
complexity	1
global-consistency	1
jsp	1
survey	1
softregular	1
proof_system	1
horn	1
table-constraint	1
repair-method	1
flow-based-algorithms	1
lower-bounds	1
preprocessing	1
arithmetic	1
p-complete	1
textbook	1

gkatsi's sat [16 articles] Export

gkatsi's tags