Satisfiability

Results: 637



#Item
71Microsoft Word - IBSdoc

Microsoft Word - IBSdoc

Add to Reading List

Source URL: foibg.com

Language: English - Date: 2015-02-02 08:44:10
72Solving Satisfiability Problems with Qualitative Preferences: a New Approach Emanuele Di Rosa, Enrico Giunchiglia, and Marco Maratea DIST - Universit`a di Genova, Italy. email:{emanuele,enrico,marco}@dist.unige.it Abstra

Solving Satisfiability Problems with Qualitative Preferences: a New Approach Emanuele Di Rosa, Enrico Giunchiglia, and Marco Maratea DIST - Universit`a di Genova, Italy. email:{emanuele,enrico,marco}@dist.unige.it Abstra

Add to Reading List

Source URL: tmancini.di.uniroma1.it

Language: English - Date: 2008-12-16 11:05:58
73Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc

Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2010-08-28 23:41:19
74Unleashing Mayhem on Binary Code

Unleashing Mayhem on Binary Code

Add to Reading List

Source URL: users.ece.cmu.edu

Language: English - Date: 2014-05-29 15:38:01
75Continued Relevance of Bit-Level Verification Research R. Brayton, N. Een, A. Mishchenko Berkeley Verification and Synthesis Research Center EECS Dept., University of California, Berkeley Introduction

Continued Relevance of Bit-Level Verification Research R. Brayton, N. Een, A. Mishchenko Berkeley Verification and Synthesis Research Center EECS Dept., University of California, Berkeley Introduction

Add to Reading List

Source URL: fm.csl.sri.com

Language: English - Date: 2010-10-30 02:14:08
76A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin

A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2011-04-03 11:35:00
77Sequential Encodings from Max-CSP into Partial Max-SAT⋆ Josep Argelich1 , Alba Cabiscol2 , Inˆes Lynce3 , and Felip Many`a4 1 2

Sequential Encodings from Max-CSP into Partial Max-SAT⋆ Josep Argelich1 , Alba Cabiscol2 , Inˆes Lynce3 , and Felip Many`a4 1 2

Add to Reading List

Source URL: www.mancoosi.org

Language: English - Date: 2012-12-16 04:54:55
78Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk

Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2009-11-10 10:56:36
79Journal of Automated Reasoning manuscript No. DOIs10817Interpolation Systems for Ground Proofs in Automated Deduction: a Survey Maria Paola Bonacina · Moa Johansson

Journal of Automated Reasoning manuscript No. DOIs10817Interpolation Systems for Ground Proofs in Automated Deduction: a Survey Maria Paola Bonacina · Moa Johansson

Add to Reading List

Source URL: www.cse.chalmers.se

Language: English - Date: 2015-03-16 05:12:39
80Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription Mikol´ aˇs Janota1 , Radu Grigore2, and Joao Marques-Silva3 1

Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription Mikol´ aˇs Janota1 , Radu Grigore2, and Joao Marques-Silva3 1

Add to Reading List

Source URL: www.mancoosi.org

Language: English - Date: 2012-12-16 04:54:55