The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Satisfiability with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1969-1979 (15) 1980-1983 (16) 1984-1986 (22) 1987-1988 (30) 1989 (18) 1990 (27) 1991 (26) 1992 (37) 1993 (70) 1994 (41) 1995 (46) 1996 (79) 1997 (46) 1998 (75) 1999 (106) 2000 (104) 2001 (128) 2002 (148) 2003 (188) 2004 (289) 2005 (284) 2006 (274) 2007 (319) 2008 (299) 2009 (318) 2010 (173) 2011 (142) 2012 (179) 2013 (136) 2014 (156) 2015 (143) 2016 (170) 2017 (176) 2018 (154) 2019 (125) 2020 (157) 2021 (167) 2022 (146) 2023 (151) 2024 (33)
Publication types (Num. hits)
article(1445) book(8) incollection(95) inproceedings(3545) phdthesis(81) proceedings(39)
Venues (Conferences, Journals, ...)
SAT(780) CoRR(355) SMT(71) CP(66) Handbook of Satisfiability(61) CADE(57) DAC(57) AAAI(54) Ann. Math. Artif. Intell.(54) J. Autom. Reason.(49) LPAR(49) CSL(48) CAV(44) IEEE Trans. Comput. Aided Des....(44) MFCS(44) Theor. Comput. Sci.(44) More (+10 of total 1016)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2045 occurrences of 901 keywords

Results
Found 5214 publication records. Showing 5213 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
18Michael Korkin Self-Organized Evolutionary Process in Sets of Interdependent Variables near the Midpoint of Phase Transition in K-Satisfiability. Search on Bibsonomy ICES The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
18Enrico Giunchiglia, Marco Maratea, Armando Tacchella, Davide Zambonin Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability. Search on Bibsonomy IJCAR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
18Poul Frederick Williams, Henrik Reif Andersen, Henrik Hulgaard Satisfiability Checking Using Boolean Expression Diagrams. Search on Bibsonomy TACAS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
18Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes Capturing Structure with Satisfiability. Search on Bibsonomy CP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
18Inês Lynce, Luís Baptista, João Marques-Silva 0001 Towards Provably Complete Stochastic Search Algorithms for Satisfiability. Search on Bibsonomy EPIA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
18Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella An Analysis of Backjumping and Trivial Truth in Quantified Boolean Formulas Satisfiability. Search on Bibsonomy AI*IA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
18Jens Gottlieb, Nico Voss Adaptive Fitness Functions for the Satisfiability Problem. Search on Bibsonomy PPSN The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Alfredo Cruz PLAtestGA: A CNF-Satisfiability Problem for the Generation of Test Vectors for Missing Faults in VLSI Circuits. Search on Bibsonomy ISMIS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Karem A. Sakallah, Fadi A. Aloul, João P. Marques Silva An Experimental Study of Satisfiability Search Heuristics. Search on Bibsonomy DATE The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Vasco M. Manquinho, João Marques-Silva 0001 On Using Satisfiability-Based Pruning Techniques in Covering Algorithms. Search on Bibsonomy DATE The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Priyank Kalla, Zhihong Zeng, Maciej J. Ciesielski, ChiLai Huang A BDD-Based Satisfiability Infrastructure Using the Unate Recursive Paradigm. Search on Bibsonomy DATE The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Bart Selman Satisfiability Testing: Recent Developments and Challenge Problems. Search on Bibsonomy LICS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. Search on Bibsonomy WAE The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Esra Erdem 0001, Vladimir Lifschitz, Martin D. F. Wong Wire Routing and Satisfiability Planning. Search on Bibsonomy Computational Logic The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Mark J. Boyd, Tracy Larrabee A Scalable, Loadable Custom Programmable Logic Device for Solving Boolean Satisfiability Problems. Search on Bibsonomy FCCM The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Luís Baptista, João Marques-Silva 0001 Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability. Search on Bibsonomy CP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18João Marques-Silva 0001 Algebraic Simplification Techniques for Propositional Satisfiability. Search on Bibsonomy CP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Edith Hemaspaandra Modal Satisfiability Is in Deterministic Linear Space. Search on Bibsonomy CSL The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Peixin Zhong, Margaret Martonosi, Pranav Ashar, Sharad Malik Using configurable computing to accelerate Boolean satisfiability. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
18Wojciech Plandowski Satisfiability of Word Equations with Constants is in PSPACE. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF word equations
18Miron Abramovici, José T. de Sousa A Virtual Logic Algorithm for Solving Satisfiability Problems Using Reconfigurable Hardware. Search on Bibsonomy FCCM The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
18C. K. Chung, Philip Heng Wai Leong An Architecture for Solving Boolean Satisfiability Using Runtime Configurable Hardware. Search on Bibsonomy ICPP Workshops The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
18Oskar Mencer, Marco Platzner Dynamic Circuit Generation for Boolean Satisfiability in an Object-Oriented Design Environment. Search on Bibsonomy HICSS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
18Gi-Joon Nam, Karem A. Sakallah, Rob A. Rutenbar Satisfiability-Based Detailed FPGA Routing. Search on Bibsonomy VLSI Design The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
18Michela Milano, Andrea Roli Solving the Satisfiability Problem through Boolean Networks. Search on Bibsonomy AI*IA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
18R. Glenn Wood, Rob A. Rutenbar FPGA routing and routability estimation via Boolean satisfiability. Search on Bibsonomy IEEE Trans. Very Large Scale Integr. Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
18Jens Gottlieb, Nico Voss Improving the Performance of Evolutionary Algorithms for the Satisfiability Problem by Refining Functions. Search on Bibsonomy PPSN The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
18Peixin Zhong, Margaret Martonosi, Pranav Ashar, Sharad Malik Solving Boolean Satisfiability with Dynamic Hardware Configurations. Search on Bibsonomy FPL The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
18Azra Rashid, Jason Leonard, William H. Mangione-Smith Dynamic Circuit Generation for Solving Specific Problem Instances of Boolean Satisfiability. Search on Bibsonomy FCCM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
18Gianluigi Folino, Clara Pizzuti, Giandomenico Spezzano Solving the Satisfiability Problem by a Parallel Celluar Genetic Algorithm. Search on Bibsonomy EUROMICRO The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
18Ian Horrocks 0001, Peter F. Patel-Schneider Optimising Propositional Modal Satisfiability for Description Logic Subsumption. Search on Bibsonomy AISC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
18Jens Gottlieb, Nico Voss Representations, Fitness Functions and Genetic Operators for the Satisfiability Problem. Search on Bibsonomy Artificial Evolution The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
18Lance Fortnow Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability. Search on Bibsonomy CCC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
18Takao Asano, Takao Ono, Tomio Hirata Approximation Algorithms for the Maximum Satisfiability Problem. Search on Bibsonomy SWAT The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
18Roberto Giaccio On-line Algorithms for Satisfiability Problems with Uncertainty. Search on Bibsonomy WG The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
18Paola Alimonti New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems. Search on Bibsonomy CIAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
18Mihalis Yannakakis On the Approximation of Maximum Satisfiability. Search on Bibsonomy SODA The full citation details ... 1992 DBLP  BibTeX  RDF
18Srimat T. Chakradhar, Vishwani D. Agrawal, Michael L. Bushnell, Thomas K. Truong Neural Net and Boolean Satisfiability Models of Logic Circuits. Search on Bibsonomy IEEE Des. Test Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
12Alessandro Armando, Jacopo Mantovani, Lorenzo Platania Bounded model checking of software using SMT solvers instead of SAT solvers. Search on Bibsonomy Int. J. Softw. Tools Technol. Transf. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Michael Huth 0001, Orna Grumberg Special section on advances in reachability analysis and decision procedures: contributions to abstraction-based system verification. Search on Bibsonomy Int. J. Softw. Tools Technol. Transf. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Bounded reachability, Bit-vector arithmetic, Abstraction, Asynchronous systems, Decision diagrams, Memory models, Decision problems
12Matthias Baaz, Agata Ciabattoni, Norbert Preining SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability. Search on Bibsonomy WoLLIC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Margus Veanes, Pavel Grigorenko, Peli de Halleux, Nikolai Tillmann Symbolic Query Exploration. Search on Bibsonomy ICFEM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Cherif R. Salama, Gregory Malecha, Walid Taha, Jim Grundy, John O'Leary Static consistency checking for verilog wire interconnects: using dependent types to check the sanity of verilog descriptions. Search on Bibsonomy PEPM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF static array bounds checking, verilog elaboration, verilog wire width consistency, dependent types, dead code elimination
12Khair Eddin Sabri, Ridha Khédri, Jason Jaskolka Verification of Information Flow in Agent-Based Systems. Search on Bibsonomy MCETECH The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Global calculus, Information Algebra, Agent Knowledge, Information Flow, Hoare Logic
12Ahmet Kara 0002, Volker Weber, Martin Lange, Thomas Schwentick On the Hybrid Extension of CTL and CTL+. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Tomi Janhunen, Ilkka Niemelä, Mark Sevalnev Computing Stable Models via Reductions to Difference Logic. Search on Bibsonomy LPNMR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Marc Denecker, Joost Vennekens, Stephen Bond, Martin Gebser, Miroslaw Truszczynski The Second Answer Set Programming Competition. Search on Bibsonomy LPNMR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Andreas Goerdt On Random Ordering Constraints. Search on Bibsonomy CSR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF random structures, Algorithms, logic, probabilistic analysis, ordering
12Andreas Goerdt On Random Betweenness Constraints. Search on Bibsonomy FCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF random structures, Algorithms, logic, probabilistic analysis
12Feifei Ma, Sheng Liu, Jian Zhang 0001 Volume Computation for Boolean Combination of Linear Arithmetic Constraints. Search on Bibsonomy CADE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Linh Anh Nguyen, Andrzej Szalas A Tableau Calculus for Regular Grammar Logics with Converse. Search on Bibsonomy CADE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Carsten Ihlemann, Viorica Sofronie-Stokkermans System Description: H-PILoT. Search on Bibsonomy CADE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF local theory extensions, hierarchical reasoning
12Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier A Schemata Calculus for Propositional Logic. Search on Bibsonomy TABLEAUX The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Carlos Areces, Diego Figueira, Daniel Gorín, Sergio Mera Tableaux and Model Checking for Memory Logics. Search on Bibsonomy TABLEAUX The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Rajeev Goré, Florian Widmann Sound Global State Caching for ALC with Inverse Roles. Search on Bibsonomy TABLEAUX The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Sergey Babenyshev, Vladimir V. Rybakov Temporal Logic for Modeling Discovery and Logical Uncertainty. Search on Bibsonomy KES (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF decidability algorithms, Kripke/Hintikka models, temporal logic, uncertainty, chance discovery
12Robert Brummayer, Armin Biere Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays. Search on Bibsonomy TACAS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Uwe Keller, Stijn Heymans Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm. Search on Bibsonomy LFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi An Automata-Theoretic Approach to Regular XPath. Search on Bibsonomy DBPL The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Marcílio Mendonça, Andrzej Wasowski, Krzysztof Czarnecki 0001 SAT-based analysis of feature models is easy. Search on Bibsonomy SPLC The full citation details ... 2009 DBLP  BibTeX  RDF
12Enrico Giunchiglia, Marco Maratea Improving Plan Quality in SAT-Based Planning. Search on Bibsonomy AI*IA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä Partitioning Search Spaces of a Randomized Search. Search on Bibsonomy AI*IA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Nikolaj S. Bjørner, Leonardo Mendonça de Moura Tapas: Theory Combinations and Practical Applications. Search on Bibsonomy FORMATS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir Open answer set programming with guarded programs. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF fixed-point logic, open domains, Answer set programming
12Zhenhua Duan, Cong Tian, Li Zhang A decision procedure for propositional projection temporal logic with infinite models. Search on Bibsonomy Acta Informatica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Ruzica Piskac, Viktor Kuncak Linear Arithmetic with Stars. Search on Bibsonomy CAV The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12 Introduction. Search on Bibsonomy Complexity of Constraints The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Muhammad Fahad 0011, Muhammad Abdul Qadir 0001, Syed Adnan Hussain Shah Evaluation of Ontologies and DL Reasoners. Search on Bibsonomy Intelligent Information Processing The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Felix Brandt 0001, Felix A. Fischer, Markus Holzer 0001 Equilibria of Graphical Games with Symmetries. Search on Bibsonomy WINE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Shaohua Liu, Junsheng Yu, Yinglong Ma, Xu Zhang, Xiaoming Liu, Hansheng Su Prioritizing Default Rules Embedded in Description Logic Knowledge Base. Search on Bibsonomy SNPD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Jens Groth, Amit Sahai Efficient Non-interactive Proof Systems for Bilinear Groups. Search on Bibsonomy EUROCRYPT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Non-interactive witness-indistinguishability, common reference string, non-interactive zero-knowledge, bilinear groups
12Syed Zafar Shazli, Mehdi Baradaran Tahoori Obtaining Microprocessor Vulnerability Factor Using Formal Methods. Search on Bibsonomy DFT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Lance Fortnow, Rahul Santhanam Infeasibility of instance compression and succinct PCPs for NP. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF instance compression, succinct PCPs, cryptography, parameterized complexity, polynomial hierarchy
12Rémi Brochenin, Stéphane Demri, Étienne Lozes On the Almighty Wand. Search on Bibsonomy CSL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Ruzica Piskac, Viktor Kuncak Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars. Search on Bibsonomy CSL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF verification and program analysis, cardinality operator, mixed linear integer-rational arithmetic, fuzzy sets, sets, multisets
12Nathan Segerlind On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs. Search on Bibsonomy CCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF lower bounds, resolution, ordered binary decision diagrams, propositional proof complexity
12Joël Ouaknine, James Worrell 0001 Some Recent Results in Metric Temporal Logic. Search on Bibsonomy FORMATS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Alexander Rabinovich Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities. Search on Bibsonomy FORMATS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Patrick Traxler The Time Complexity of Constraint Satisfaction. Search on Bibsonomy IWPEC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Viorica Sofronie-Stokkermans On unification for bounded distributive lattices. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF decision procedures for the positive theory, Theorem proving, unification, distributive lattices, SAT solving
12Zhi-Hong Tao, Conghua Zhou, Zhong Chen, Lifu Wang Bounded Model Checking of CTL. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF symbolic model checking, bounded model checking, QBF, CTL*
12Colin Cooper, Alan M. Frieze, Gregory B. Sorkin Random 2-SAT with Prescribed Literal Degrees. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Joseph Y. Halpern, Riccardo Pucella Characterizing and reasoning about probabilistic and non-probabilistic expectation. Search on Bibsonomy J. ACM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Dempster-Shafer belief functions, probability theory, Expectation, possibility measures
12Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Sais Eliminating Redundant Clauses in SAT Instances. Search on Bibsonomy CPAIOR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Laura Giordano 0001, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato Preferential Description Logics. Search on Bibsonomy LPAR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Stéphane Demri, Alexander Rabinovich The Complexity of Temporal Logic with Until and Since over Ordinals. Search on Bibsonomy LPAR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Alberto Griggio, Ziyad Hanna, Alexander Nadel, Amit Palti, Roberto Sebastiani A Lazy and Layered SMT($\mathcal{BV}$) Solver for Hard Industrial Verification Problems. Search on Bibsonomy CAV The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Kunal P. Ganeshpure, Sandip Kundu Interactive presentation: Automatic test pattern generation for maximal circuit noise in multiple aggressor crosstalk faults. Search on Bibsonomy DATE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Victor V. Toporkov Dataflow Analysis of Distributed Programs Using Generalized Marked Nets. Search on Bibsonomy DepCoS-RELCOMEX The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Marcin Jurdzinski, Ranko Lazic 0001 Alternation-free modal mu-calculus for data trees. Search on Bibsonomy LICS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell 0001 The Cost of Punctuality. Search on Bibsonomy LICS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Zvonimir Rakamaric, Roberto Bruttomesso, Alan J. Hu, Alessandro Cimatti Verifying Heap-Manipulating Programs in an SMT Framework. Search on Bibsonomy ATVA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Stefan Göller, Markus Lohrey, Carsten Lutz PDL with Intersection and Converse Is 2 EXP-Complete. Search on Bibsonomy FoSSaCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Lionel Paris, Richard Ostrowski, Pierre Siegel, Lakhdar Sais From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets. Search on Bibsonomy MICAI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Artiom Alhazov, Mario J. Pérez-Jiménez Uniform Solution of. Search on Bibsonomy MCU The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub Conflict-Driven Answer Set Enumeration. Search on Bibsonomy LPNMR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Todd Deshane, Wenjin Hu, Patty Jablonski, Hai Lin 0005, Christopher Lynch, Ralph Eric McGregor Encoding First Order Proofs in SAT. Search on Bibsonomy CADE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Thomas Schwentick, Volker Weber Bounded-Variable Fragments of Hybrid Logics. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Ahmed Bouajjani, Yan Jurski, Mihaela Sighireanu A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes. Search on Bibsonomy TACAS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Éric Grégoire, Bertrand Mazure, Cédric Piette MUST: Provide a Finer-Grained Explanation of Unsatisfiability. Search on Bibsonomy CP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF unsatisfiability, MUC, MUS, MUST, CSP, explanation, constraint networks
Displaying result #801 - #900 of 5213 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license