gkatsi's library 677 articles Export

	Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems [My Copy] Artificial Intelligence, Vol. 58, No. 1-3. (December 1992), pp. 161-205. by Steven Minton, Mark D. Johnston, Andrew B. Philips, Philip Laird posted to repair-method local-search experimental by gkatsi on 2009-11-27 21:27:29 as
	Optimization of Simple Tabular Reduction for Table Constraints [My Copy] Principles and Practice of Constraint Programming (2008), pp. 128-143. by Christophe Lecoutre posted to table-constraint gacschema gac by gkatsi on 2009-11-27 21:24:01 as along with 1 person radsz
	Symmetry Breaking and Local Search Spaces [My Copy] Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2005), pp. 273-287. by Steven Prestwich, Andrea Roli posted to symmetry-breaking local-search experimental by gkatsi on 2009-11-17 16:10:19 as
	Negative Effects of Modeling Techniques on Search Performance [My Copy] Annals of Operations Research, Vol. 118, No. 1. (1 February 2003), pp. 137-150. by S. Prestwich posted to symmetry-breaking modeling local-search experimental by gkatsi on 2009-11-17 15:10:18 as
	Snake Lex: An Alternative to Double Lex [My Copy] Principles and Practice of Constraint Programming - CP 2009 (2009), pp. 391-399. by Andrew Grayland, Ian Miguel, Colva Roney-Dougal posted to symmetry-breaking symmetry by gkatsi on 2009-11-13 08:51:16 as
	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
	Boundary Points and Resolution [My Copy] Theory and Applications of Satisfiability Testing - SAT 2009 (2009), pp. 147-160. by Eugene Goldberg posted to resolution proof-complexity cdcl by gkatsi on 2009-11-05 14:36:34 as
	Formalizing Dangerous SAT Encodings [My Copy] Theory and Applications of Satisfiability Testing – SAT 2007 (2007), pp. 159-172. by Alexander Hertel, Philipp Hertel, Alasdair Urquhart posted to resolution proof-complexity by gkatsi on 2009-11-02 12:34:26 as along with 1 person pwais
	Information Theory, Inference & Learning Algorithms [My Copy] (15 June 2002) by David J. C. MacKay posted to information-theory compression by gkatsi on 2009-10-29 15:52:05 as along with 62 people and 5 groups derek_farn fjanoos flips Sergey_gerbek vgauthier foekenev pjmaybank serebryakov mdengler jorgeac Fantozzi ARobson betting awarlau Adso dullhunk brian Maderlock alexzeh thefillm pprett ppeeling A_Olympia ansobol yaroslavvb JoSeK ingo jrw rpadams gyuli dariusb simonjudge leidner bayesian BarrosH wnpx filippone marcosmuller danielaugot zielaj daveh spirit_of_numenor sbarthelme anon_pl dwf petrijooste wowbagger nrubens chrisc rsantana fishtank rwilliamson poluxmoon robertoalamino brianmc lop matjes delip markusd ekatsyrk luispedro robotact Philosophy_of_Information Blog_and_Wiki_Research AssistiveTechnology inference-group ComplexAdaptiveSystems
	Computational Complexity [My Copy] (30 November 1993) by Christos H. Papadimitriou posted to textbook complexity by gkatsi on 2009-10-29 15:50:04 as along with 7 people JoeCamel pwais BarrosH gagliol eporreca masteraka JakubSzymanik
	On Subsumption Removal and On-the-Fly CNF Simplification [My Copy] Theory and Applications of Satisfiability Testing (2005), pp. 482-489. by Lintao Zhang posted to subsumption resolution cnf by gkatsi on 2009-10-29 14:47:35 as along with 1 person mrodriguezmuro
	Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs [My Copy] Theory and Applications of Satisfiability Testing - SAT 2006 (2006), pp. 48-53. by Allen Van Gelder posted to resolution proof-complexity by gkatsi on 2009-10-26 18:07:29 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
	Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces [My Copy] Theory and Applications of Satisfiability Testing - SAT 2009 (2009), pp. 141-146. by Allen Van Gelder posted to resolution minimization dpll by gkatsi on 2009-10-26 17:45:17 as
	Short proofs are narrow---resolution made simple [My Copy] J. ACM, Vol. 48, No. 2. (2001), pp. 149-169. by Eli B. Sasson, Avi Wigderson posted to resolution proof-complexity by gkatsi on 2009-10-20 23:10:14 as
	A short proof of the pigeon hole principle using extended resolution [My Copy] SIGACT News, Vol. 8, No. 4. (1976), pp. 28-32. by Stephen A. Cook posted to resolution extended-resolution by gkatsi on 2009-10-19 16:25:08 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
	A Compression Algorithm for Large Arity Extensional Constraints [My Copy] Principles and Practice of Constraint Programming – CP 2007 (2007), pp. 379-393. by George Katsirelos, Toby Walsh posted to propagation gacschema gac decision-trees compression by gkatsi on 2009-10-19 14:41:54 as along with 1 person radsz
	Filtering for Subgraph Isomorphism [My Copy] Principles and Practice of Constraint Programming – CP 2007 (2007), pp. 728-742. by Stéphane Zampelli, Yves Deville, Christine Solnon, Sébastien Sorlin, Pierre Dupont posted to subgraph-isomorphism propagation by gkatsi on 2009-10-19 14:37:53 as along with 1 person radsz
	Clause Form Conversions for Boolean Circuits [My Copy] Theory and Applications of Satisfiability Testing (2005), pp. 183-198. by Paul Jackson, Daniel Sheridan posted to cnf circuits by gkatsi on 2009-10-16 12:19:15 as
	On Universal Restart Strategies for Backtracking Search [My Copy] Principles and Practice of Constraint Programming – CP 2007 (2007), pp. 681-695. by Huayue Wu, Peter van Beek posted to restarts by gkatsi on 2009-10-16 12:15:41 as along with 2 people gagliol radsz
	Fast set bounds propagation using BDDs [My Copy] In Proceedings of the European Conference on Artificial Intelligence ECAI08 (2008), pp. 505-509. by G. Gange, V. Lagoon, P. J. Stuckey posted to set-variables propagation bdd by gkatsi on 2009-09-30 14:11:34 as
	Variety Reasoning for Multiset Constraint Propagation [My Copy] In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-09) (2009), pp. 552-558. by Yat C. Law, Jimmy H. M. Lee, May H. C. Woo edited by Craig Boutilier posted to set-variables propagation multiset-variables by gkatsi on 2009-09-30 13:23:29 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
	Flow-Based Propagators for the SEQUENCE and Related Global Constraints [My Copy] Principles and Practice of Constraint Programming (2008), pp. 159-174. by Michael Maher, Nina Narodytska, Claude-Guy Quimper, Toby Walsh posted to soft-constraints sequence global-constraints flow-based-algorithms by gkatsi on 2009-09-30 13:17:44 as along with 1 person and 1 group radsz Constraint Programming
	Short proofs for tricky formulas [My Copy] Acta Informatica, Vol. 22, No. 3. (1 August 1985), pp. 253-275. by Balakrishnan Krishnamurthy posted to symmetry resolution propositional_calculus proof_system extended-resolution by gkatsi on 2009-09-13 22:47:34 as
	A Cost-Regular Based Hybrid Column Generation Approach [My Copy] Constraints, Vol. 11, No. 4. (1 December 2006), pp. 315-333. by Sophie Demassey, Gilles Pesant, Louis-Martin Rousseau posted to no-tag by gkatsi on 2009-09-09 16:36:33 as
	A Quasi-polynomial-time Algorithm for Sampling Words from a Context-Free Language [My Copy] Information and Computation, Vol. 134, No. 1. (10 April 1997), pp. 59-74. by V. Gore, M. Jerrum, S. Kannan, Z. Sweedyk, S. Mahaney posted to grammar counting automata by gkatsi on 2009-09-06 18:35:54 as
	On the complexity of intersecting finite state automata [My Copy] Computational Complexity, 2000. Proceedings. 15th Annual IEEE Conference on In Computational Complexity, 2000. Proceedings. 15th Annual IEEE Conference on (2000), pp. 229-234. by G. Karakostas, R. J. Lipton, A. Viglas posted to automata by gkatsi on 2009-08-17 18:47:38 as
	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
	Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints [My Copy] Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2008), pp. 298-302. by Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant posted to global-constraints local-search propagation by gkatsi on 2009-08-04 17:29:21 as along with 1 person radsz
	Space Bounds for Resolution [My Copy] Information and Computation, Vol. 171, No. 1. (25 November 2001), pp. 84-97. by J. Esteban, J. Torán posted to resolution by gkatsi on 2009-08-04 15:21:25 as
	NP-Complete decision problems for binary quadratics [My Copy] Journal of Computer and System Sciences, Vol. 16, No. 2. (April 1978), pp. 168-184. by K. Manders, L. Adleman posted to no-tag by gkatsi on 2009-07-30 17:40:50 as
	Simultaneous matchings: Hardness and approximation☆ [My Copy] Journal of Computer and System Sciences, Vol. 74, No. 5. (August 2008), pp. 884-897. by M. Kutz, K. Elbassioni, I. Katriel, M. Mahajan posted to alldifferent global-constraints matching by gkatsi on 2009-07-30 15:09:35 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
	Perfect Constraints Are Tractable [My Copy] Principles and Practice of Constraint Programming (2008), pp. 524-528. by András Salamon, Peter Jeavons posted to tractable by gkatsi on 2009-07-29 14:45:07 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
	Tractable disjunctions of linear constraints [My Copy] Principles and Practice of Constraint Programming — CP96 (1996), pp. 297-307. by Manolis Koubarakis posted to no-tag by gkatsi on 2009-07-24 15:29:25 as
	Boosting the Interval Narrowing Algorithm [My Copy] In JICSLP (1996), pp. 378-392. by Olivier Lhomme, Arnaud Gotlieb, Michel Rueher, Patrick Taillibert posted to no-tag by gkatsi on 2009-07-24 15:11:08 as
	Dynamic optimization of interval narrowing algorithms [My Copy] The Journal of Logic Programming, Vol. 37, No. 1-3. (12 October 1998), pp. 165-183. by O. Lhomme, A. Gotlieb, M. Rueher posted to no-tag by gkatsi on 2009-07-24 15:07:40 as
	A class of polynomially solvable range constraints for interval analysis without widenings [My Copy] Theoretical Computer Science, Vol. 345, No. 1. (21 November 2005), pp. 122-138. by Z. Su, D. Wagner posted to no-tag by gkatsi on 2009-07-21 18:44:30 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
	Integer programming with 2-variable equations and 1-variable inequalities [My Copy] Information Processing Letters, Vol. 109, No. 11. (16 May 2009), pp. 572-575. by Manuel Bodirsky, Gustav Nordh, Timo von Oertzen posted to integer-programming tractable by gkatsi on 2009-07-21 17:39:37 as
	No better ways to generate hard NP instances than picking uniformly at random [My Copy] Symposium on Foundations of Computer Science, Vol. 0 (1990) by R. Impagliazzo, L. Levin posted to no-tag by gkatsi on 2009-07-21 17:32:08 as
	Tree automata, mu-calculus and determinacy [My Copy] Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on In Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on (1991), pp. 368-377. by E. A. Emerson, C. S. Jutla posted to no-tag by gkatsi on 2009-07-21 16:03:00 as
	Fast and Flexible Difference Constraint Propagation for DPLL(T) [My Copy] Theory and Applications of Satisfiability Testing - SAT 2006 (2006), pp. 170-183. by Scott Cotton, Oded Maler posted to smt by gkatsi on 2009-07-21 15:21:08 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
	The Weighted Cfg Constraint [My Copy] Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2008), pp. 323-327. by George Katsirelos, Nina Narodytska, Toby Walsh posted to gac global-constraints grammar soft-constraints by gkatsi on 2009-07-20 19:20:21 as along with 1 person radsz

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

Result page: 1 2 3 4 5 6 7 8 9 10 Next

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

gkatsi's library 677 articles Export

gkatsi's tags