|
|
Venues (Conferences, Journals, ...)
|
|
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 |
18 | Hachemi Bennaceur |
A Comparison between SAT and CSP Techniques. |
Constraints An Int. J. |
2004 |
DBLP DOI BibTeX RDF |
constraint satisfaction, satisfiability |
18 | Etienne de Klerk, Dmitrii V. Pasechnik, Joost P. Warners |
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function. |
J. Comb. Optim. |
2004 |
DBLP DOI BibTeX RDF |
semidefiniteprogramming, Lovász -function, MAX-k-CUT, approximation algorithms, satisfiability, graph colouring |
18 | Hans Kleine Büning, Xishun Zhao |
On Models for Quantified Boolean Formulas. |
Logic versus Approximation |
2004 |
DBLP DOI BibTeX RDF |
model checking, complexity, Boolean function, satisfiability, quantified Boolean formula |
18 | Daya Ram Gaur, Ramesh Krishnamurti |
Average Case Self-Duality of Monotone Boolean Functions. |
Canadian AI |
2004 |
DBLP DOI BibTeX RDF |
Machine Learning, Knowledge Representation, Satisfiability, Self-duality, Monotone Boolean Functions |
18 | Sudeshna Dasgupta, Vijay Chandru |
Minimal Unsatisfiable Sets: Classification and Bounds. |
ASIAN |
2004 |
DBLP DOI BibTeX RDF |
Minimal Unsatisfiable Sets, satisfiability, propositional logic, Boolean formulas |
18 | Karl Meinke |
Automated black-box testing of functional correctness using function approximation. |
ISSTA |
2004 |
DBLP DOI BibTeX RDF |
formal specification, approximation, functional test, constraint solving, test coverage, black-box test, satisfiability problem |
18 | Juan Frausto Solís, Marco Antonio Cruz-Chavez |
A Reduced Codification for the Logical Representation of Job Shop Scheduling Problems. |
ICCSA (4) |
2004 |
DBLP DOI BibTeX RDF |
the propositional satisfiability problem (SAT), Latest starting time, SAT formula, Job shop scheduling |
18 | Paul T. Darga, Mark H. Liffiton, Karem A. Sakallah, Igor L. Markov |
Exploiting structure in symmetry detection for CNF. |
DAC |
2004 |
DBLP DOI BibTeX RDF |
abstract algebra, partition refinement, symmetry, backtrack search, graph automorphism, boolean satisfiability (SAT) |
18 | William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Yang 0006, Marek A. Perkowski |
Quantum logic synthesis by symbolic reachability analysis. |
DAC |
2004 |
DBLP DOI BibTeX RDF |
model checking, formal verification, quantum computing, satisfiability, reversible logic |
18 | Mohammad Ghasemzadeh 0001, Volker Klotz, Christoph Meinel |
Embedding Memoization to the Semantic Tree Search for Deciding QBFs. |
Australian Conference on Artificial Intelligence |
2004 |
DBLP DOI BibTeX RDF |
Zero-Suppressed Binary Decision Diagram (ZDD), Quantified Boolean Formula (QBF), QSAT, Satisfiability, DPLL |
18 | Steffen Reith |
On the Complexity of Some Equivalence Problems for Propositional Calculi. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
Boolean isomorphism, Boolean equivalence, closed classes, Computational complexity, Boolean functions, satisfiability problems, Dichotomy, Post |
18 | Donald Chai, Andreas Kuehlmann |
A fast pseudo-boolean constraint solver. |
DAC |
2003 |
DBLP DOI BibTeX RDF |
0-1 ILP, pseudo-boolean, satisfiability |
18 | Maria K. Michael, Spyros Tragoudas |
ATPG tools for delay faults at the functional level. |
ACM Trans. Design Autom. Electr. Syst. |
2002 |
DBLP DOI BibTeX RDF |
functional-level testing, path delay fault simulation (coverage), testing digital circuits, Automatic test pattern generation, Binary Decision Diagrams, delay testing, Boolean Satisfiability, path delay fault testing |
18 | Farinaz Koushanfar, Jennifer L. Wong, Jessica Feng, Miodrag Potkonjak |
ILP-based engineering change. |
DAC |
2002 |
DBLP DOI BibTeX RDF |
engineering change, satisfiability(SAT), synthesis, integer linear programming |
18 | Malay K. Ganai, Pranav Ashar, Aarti Gupta, Lintao Zhang, Sharad Malik |
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver. |
DAC |
2002 |
DBLP DOI BibTeX RDF |
boolean constraint propagation (BCP), bounded model checking (BMC), conjunctive normal form (CNF), boolean satisfiability (SAT) |
18 | Paulo F. Flores, Horácio C. Neto, João P. Marques Silva |
An exact solution to the minimum size test pattern problem. |
ACM Trans. Design Autom. Electr. Syst. |
2001 |
DBLP DOI BibTeX RDF |
propositional satisfiability (SAT), verification and test, built-in self-test (BIST), Automatic test pattern generation (ATPG), integer linear programming (ILP) |
18 | Yoshinao Isobe, Kazuhito Ohmaki |
A process logic for distributed system synthesis . |
APSEC |
2000 |
DBLP DOI BibTeX RDF |
process logic, distributed system synthesis, concurrent behavior, interleaving behavior, DS algebra, SP logic, computability, process algebra, process algebra, satisfiability, algebraic specification, concurrency theory |
18 | Gilles Audemard, Belaid Benhamou, Pierre Siegel |
AVAL: An Enumerative Method for SAT. |
Computational Logic |
2000 |
DBLP DOI BibTeX RDF |
satisfiability, enumeration, deduction |
18 | Hidetomo Nabeshima, Katsumi Inoue, Hiromasa Haneda |
Implementing an action language using a SAT solver. |
ICTAI |
2000 |
DBLP DOI BibTeX RDF |
planning algorithms, plan search space, planning graph, SAT planning, AMP, domain description, Java, Java, data structures, data structure, planning (artificial intelligence), computability, inference mechanisms, satisfiability problem, SAT solver, reasoning about action, model generation, action language |
18 | Jianzhong Zhang 0001, Xiaoguang Yang, Mao-cheng Cai |
Reverse Center Location Problem. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
networks and graphs, maximum cost circulation. ams subject classification. 68q25, np-hard, 90c27, relaxation, satisfiability problem |
18 | Ramón Béjar, Felip Manyà |
Phase Transitions in the Regular Random 3-SAT Problem. |
ISMIS |
1999 |
DBLP DOI BibTeX RDF |
regular CNF formulas, benchmarks, satisfiability, threshold, Multiple-valued logics, phase transitions |
18 | Fritz Henglein, Jakob Rehof |
The Complexity of Subtype Entailment for Simple Types. |
LICS |
1997 |
DBLP DOI BibTeX RDF |
subtype entailment complexity, atomic entailment, coNP-completeness, complexity-theoretic marker, exponential explosion, subtype inference, structural complexity bounds, computability, satisfiability, axiomatization, linear-time algorithm |
18 | Keith Vanderveen, C. V. Ramamoorthy |
Partial instantiation theorem proving for distributed resource location. |
COMPSAC |
1997 |
DBLP DOI BibTeX RDF |
partial instantiation theorem prover, distributed resource location, INSTANT, clausal form, non clausal form, GSAT algorithm, propositional sentence, request matching, CORBA Object Trading Service, KIF, theorem proving, satisfiability, first order logic, KQML |
18 | Aloysius K. Mok, Guangtian Liu |
Early detection of timing constraint violation at runtime. |
RTSS |
1997 |
DBLP DOI BibTeX RDF |
timing constraint violation detection, timing constraint compliance, conditional guarantees, satisfiability checking algorithm, timing constraint monitoring, time terms, timing constraint specification, real-time systems, real time applications |
18 | Daniela Rosu 0001, Karsten Schwan, Sudhakar Yalamanchili, Rakesh Jha |
On adaptive resource allocation for complex real-time application. |
RTSS |
1997 |
DBLP DOI BibTeX RDF |
complex real-time applications, high-performance real-time applications, limited resource availability, embedded system platforms, resource needs, over-sizing, worst-case application needs, time-critical applications, C31 systems, resource allocation, satisfiability, timing constraints, data-dependent, performance metrics, adaptive resource allocation |
18 | Kazuo Kawakubo, Koji Tanaka, Hiromi Hiraishi |
Formal Verification Of Self-Testing Properties Of Combinational Circuits. |
Asian Test Symposium |
1996 |
DBLP DOI BibTeX RDF |
self-testing properties, logic function manipulation, decision function, output code words, self-checking logic, mutiple-input multiple-output circuit, fault tolerance, formal verification, combinational circuits, combinational circuits, binary decision diagrams, stuck-at faults, satisfiability problem, characteristic functions, Berger code |
18 | Kaori Yoshida, Torao Yanaru |
A proposal of emotional memory model. |
ANNES |
1995 |
DBLP DOI BibTeX RDF |
neural network, stability, satisfiability problem, Lagrangian method, propositional calculus |
18 | Sivaramakrishnan Venkatraman, Sharad C. Seth, Prathima Agrawal |
Parallel test generation with low communication overhead. |
VLSI Design |
1995 |
DBLP DOI BibTeX RDF |
parallel test generation, low communication overhead, dynamic search-space allocation strategy, Sequent multiprocessor, parallel algorithms, logic testing, Boolean functions, analytical model, combinational circuits, shared memory multiprocessor, shared memory systems, processor scheduling, software performance evaluation, boolean satisfiability, combinational logic, greedy heuristic |
18 | E. Allen Emerson, Jai Srinivasan |
Branching time temporal logic. |
REX Workshop |
1988 |
DBLP DOI BibTeX RDF |
Modal and Temporal Logic: Branching time temporal logic, linear time temporal logic, model checking - Logics of Programs: Reasoning about concurrent programs, specification of and reasoning about fairness - Software Engineering: Specification techniques, automated verification techniques - Computational Complexity, Automata Theory: Finite-state automata on infinite objects, program verification, satisfiability, decidability, expressiveness, decision procedures, dynamic logics, tree automata, axiomatics, program specification, mechanical synthesis |
18 | Anand Bhalgat, Tanmoy Chakraborty 0001, Sanjeev Khanna |
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games. |
EC |
2010 |
DBLP DOI BibTeX RDF |
cut games, party affiliation games, potential games, pure nash equilibrium, approximation algorithms |
18 | |
Validity (Satisfiability). |
Encyclopedia of Database Systems |
2009 |
DBLP DOI BibTeX RDF |
|
18 | David Déharbe, Silvio Ranise |
Satisfiability solving for software verification. |
Int. J. Softw. Tools Technol. Transf. |
2009 |
DBLP DOI BibTeX RDF |
Equational theorem proving, Boolean solving, Theory reasoning, Software verification |
18 | Kanupriya Gulati, Suganth Paul, Sunil P. Khatri, Srinivas Patil, Abhijit Jas |
FPGA-based hardware acceleration for Boolean satisfiability. |
ACM Trans. Design Autom. Electr. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Boolean satisfiabilty (SAT), boolean constant propagation (BCP), conflict induced clauses, non-chronological backtrack, FPGA |
18 | Sharad Malik, Lintao Zhang |
Boolean satisfiability from theoretical hardness to practical success. |
Commun. ACM |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley |
A Theoretical Analysis of the k-Satisfiability Search Space. |
SLS |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Alessandro Ferrante, Margherita Napoli, Mimmo Parente |
Graded-CTL: Satisfiability and Symbolic Model Checking. |
ICFEM |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Lukas Kroc, Ashish Sabharwal, Bart Selman |
Message-passing and local heuristics as decimation strategies for satisfiability. |
SAC |
2009 |
DBLP DOI BibTeX RDF |
survey propagation, heuristics, SAT, belief propagation, constraint reasoning |
18 | Emanuel Kieronski, Lidia Tendera |
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations. |
LICS |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl |
The Lovász Local Lemma and Satisfiability. |
Efficient Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Ilkka Niemelä |
Integrating Answer Set Programming and Satisfiability Modulo Theories. |
LPNMR |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Emilia Oikarinen, Matti Järvisalo |
Max-ASP: Maximum Satisfiability of Answer Set Programs. |
LPNMR |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Diego Figueira |
Satisfiability of downward XPath with data equality tests. |
PODS |
2009 |
DBLP DOI BibTeX RDF |
bip automaton, data-tree, infinite alphabet, unranked unordered tree, xpath, xml, data values |
18 | Rajeev Goré, Florian Widmann |
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability. |
CADE |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Enrica Nicolini, Christophe Ringeissen, Michaël Rusinowitch |
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets. |
TACAS |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Syed Zafar Shazli, Mehdi Baradaran Tahoori |
Soft error rate computation in early design stages using boolean satisfiability. |
ACM Great Lakes Symposium on VLSI |
2009 |
DBLP DOI BibTeX RDF |
soft error, hardware description language, reliability modeling |
18 | Héctor Navarro, Saeid Nooshabadi, Juan A. Montiel-Nelson, Victor Navarro-Botello, Javier Sosa, José C. García 0001 |
A geometric approach to register transfer level satisfiability. |
ISQED |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Peng Guo, Wenjian Luo, Zhifang Li, Houjun Liang, Xufa Wang |
Hybridizing Evolutionary Negative Selection Algorithm and Local Search for Large-Scale Satisfiability Problems. |
ISICA |
2009 |
DBLP DOI BibTeX RDF |
Evolutionary Negative Selection Algorithm, Flip Heuristic, SAT |
18 | Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchus |
Beyond CNF: A Circuit-Based QBF Solver. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Bistra Dilkina, Carla P. Gomes, Ashish Sabharwal |
Backdoors in the Context of Learning. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Marko Samer, Helmut Veith |
Encoding Treewidth into SAT. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Shai Haim, Toby Walsh |
Restart Strategy Selection Using Machine Learning Techniques. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Florian Lonsing, Armin Biere |
A Compact Representation for Syntactic Dependencies in QBFs. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Timo Berthold, Stefan Heinz 0001, Marc E. Pfetsch |
Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Mark H. Liffiton, Karem A. Sakallah |
Generalizing Core-Guided Max-SAT. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Allen Van Gelder |
Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Jan Johannsen |
An Exponential Lower Bound for Width-Restricted Clause Learning. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Suchismita Roy, P. P. Chakrabarti 0001, Pallab Dasgupta |
Satisfiability Models for Maximum Transition Power. |
IEEE Trans. Very Large Scale Integr. Syst. |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Andreas Björklund, Thore Husfeldt |
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Exact satisfability, Number of perfect matchings, Set cover, Exact algorithms, Set partition |
18 | Ju Wang 0005, Yuncheng Jiang, Yuming Shen |
Satisfiability and reasoning mechanism of terminological cycles in description logic vL . |
Sci. China Ser. F Inf. Sci. |
2008 |
DBLP DOI BibTeX RDF |
terminological cycles, description graph, model, description logic |
18 | Tommi A. Junttila, Jori Dubrovin |
Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking. |
LPAR |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro |
Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time. |
ICTAC |
2008 |
DBLP DOI BibTeX RDF |
bi-infinite words and automata, Bounded model checking, metric temporal logic |
18 | Miroslav N. Velev, Ping Gao 0002 |
Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems. |
DATE |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Lijuan Luo, Martin D. F. Wong |
Ordered escape routing based on Boolean satisfiability. |
ASP-DAC |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Martin Fränzle, Holger Hermanns, Tino Teige |
Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems. |
HSCC |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Margus Veanes, Ando Saabas |
Using Satisfiability Modulo Theories to Analyze Abstract State Machines (Abstract). |
ABZ |
2008 |
DBLP DOI BibTeX RDF |
|
18 | John D. Backes, Brian Fett, Marc D. Riedel |
The analysis of cyclic circuits with Boolean satisfiability. |
ICCAD |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Alessandro Cimatti, Alberto Griggio, Roberto Sebastiani |
Efficient Interpolant Generation in Satisfiability Modulo Theories. |
TACAS |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Martin De Wulf, Laurent Doyen 0001, Nicolas Maquet, Jean-François Raskin |
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking. |
TACAS |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Catalin Dima |
Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall. |
CLIMA |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Hervé Daudé, Vlady Ravelomanana |
Random 2-XORSAT at the Satisfiability Threshold. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Wonhong Nam, Hyunyoung Kil, Dongwon Lee 0001 |
Type-Aware Web Service Composition Using Boolean Satisfiability Solver. |
CEC/EEE |
2008 |
DBLP DOI BibTeX RDF |
|
18 | John D. Davis, Zhangxi Tan, Fang Yu 0002, Lintao Zhang |
A practical reconfigurable hardware accelerator for Boolean satisfiability solvers. |
DAC |
2008 |
DBLP DOI BibTeX RDF |
BCP, FPGA, reconfigurable, SAT solver, co-processor |
18 | Yong Gao 0001 |
Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Mark H. Liffiton, Karem A. Sakallah |
Searching for Autarkies to Trim Unsatisfiable Clause Sets. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Hans van Maaren, Siert Wieringa |
Finding Guaranteed MUSes Fast. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol |
New Results on the Phase Transition for Random Quantified Boolean Formulas. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Kazuo Iwama |
SAT, UNSAT and Coloring. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Stephan Kottler, Michael Kaufmann 0001, Carsten Sinz |
Computation of Renameable Horn Backdoors. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Dominique de Werra, Peter L. Hammer |
Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization. |
Ann. Oper. Res. |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Loganathan Lingappan, Niraj K. Jha |
Satisfiability-Based Automatic Test Program Generation and Design for Testability for Microprocessors. |
IEEE Trans. Very Large Scale Integr. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Nachiketh R. Potlapally, Anand Raghunathan, Srivaths Ravi 0001, Niraj K. Jha, Ruby B. Lee |
Aiding Side-Channel Attacks on Cryptographic Software With Satisfiability-Based Analysis. |
IEEE Trans. Very Large Scale Integr. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Andrew C. Ling, Deshanand P. Singh, Stephen Dean Brown |
FPGA PLB Architecture Evaluation and Area Optimization Techniques Using Boolean Satisfiability. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Marcos Villagra, Benjamín Barán |
Ant Colony Optimization with Adaptive Fitness Function for Satisfiability Testing. |
WoLLIC |
2007 |
DBLP DOI BibTeX RDF |
Adaptive Fitness Function, Local Search, Ant Colony Optimization, SAT |
18 | Jun Liu 0001, Luis Martínez-López 0001, Yang Xu 0001, Zhirui Lu |
Satisfiability in a Linguistic-Valued Logic and Its Quasi-horn Clause Inference Framework. |
IFSA (2) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Djamal Habet, Michel Vasquez |
Improving Local Search for Satisfiability Problem by Integrating Structural Properties. |
RIVF |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Pilar Pozos Parra, Verónica Borja Macías |
Partial Satisfiability-Based Merging. |
MICAI |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Yeting Ge, Clark W. Barrett, Cesare Tinelli |
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories. |
CADE |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Djamal Habet, Lionel Paris, Belaid Benhamou |
Consistent Neighborhood for the Satisfiability Problem. |
ICTAI (2) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Daniel Singer, Anthony Monnet |
JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) Based on Join-and-Check. |
PPAM |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio |
Challenges in Satisfiability Modulo Theories. |
RTA |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Qihua Wang, Ninghui Li |
Satisfiability and Resiliency in Workflow Systems. |
ESORICS |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Sean Safarpour, Hratch Mangassarian, Andreas G. Veneris, Mark H. Liffiton, Karem A. Sakallah |
Improved Design Debugging Using Maximum Satisfiability. |
FMCAD |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison |
Satisfiability of a Spatial Logic with Tree Variables. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Sayak Ray, Pallab Dasgupta, P. P. Chakrabarti 0001 |
A New Pseudo-Boolean Satisfiability based approach to Power Mode Schedulability Analysis. |
VLSI Design |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Martin Wehrle, Jussi Rintanen |
Planning as Satisfiability with Relaxed $-Step Plans. |
Australian Conference on Artificial Intelligence |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Duc Nghia Pham, John Thornton 0001, Charles Gretton, Abdul Sattar 0001 |
Advances in Local Search for Satisfiability. |
Australian Conference on Artificial Intelligence |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Panagiotis Manolios, Daron Vroon 0001 |
Efficient Circuit to CNF Conversion. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Stefan Staber, Roderick Bloem |
Fault Localization and Correction with QBF. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Marijn Heule, Hans van Maaren |
Effective Incorporation of Double Look-Ahead Procedures. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Juan Antonio Navarro Pérez, Andrei Voronkov |
Encodings of Problems in Effectively Propositional Logic. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #601 - #700 of 5213 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ 15][ 16][ >>] |
|