Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Zbigniew Stachniak
2010 – today
- 2011
[c21]Anton Belov, Matti Järvisalo, Zbigniew Stachniak: Depth-Driven Circuit-Level Stochastic Local Search for SAT. IJCAI 2011: 504-509- 2010
- [c20]Anton Belov, Zbigniew Stachniak: Improved Local Search for Circuit Satisfiability. SAT 2010: 293-299
2000 – 2009
- 2009
- [c19]Anton Belov, Zbigniew Stachniak: Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability. SAT 2009: 258-264
- 2008
- [j10]Zbigniew Stachniak, Anton Belov: Weighting strategy for non-clausal resolution. J. Exp. Theor. Artif. Intell. 20(1): 61-78 (2008)
- [c18]Zbigniew Stachniak, Anton Belov: Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning. SAT 2008: 257-270
- [p1]
- 2007
- [j9]Zbigniew Stachniak: Intel SIM8-01: A Proto-PC. IEEE Annals of the History of Computing 29(1): 34-48 (2007)
- 2005
- [c17]Anton Belov, Zbigniew Stachniak: Substitutional Definition of Satisfiability in Classical Propositional Logic. SAT 2005: 31-45
- 2004
- [c16]Zbigniew Stachniak: Finite Algebras and AI: From Matrix Semantics to Stochastic Local Search. AISC 2004: 8-14
- [c15]
- 2003
- [j8]Zbigniew Stachniak: The Making of the MCM/70 Microcomputer. IEEE Annals of the History of Computing 25(2): 62-75 (2003)
- 2001
- [j7]Zbigniew Stachniak: Non-Clausal Reasoning with Definite Theories. Fundam. Inform. 48(4): 363-388 (2001)
- [c14]
1990 – 1999
- 1999
- [c13]
- 1998
- [j6]
- [c12]
- 1995
- [j5]Zbigniew Stachniak: Nonmonotonic Theories and Their Axiomatic Varieties. Journal of Logic, Language and Information 4(4): 317-334 (1995)
- 1994
- [c11]Zbigniew Stachniak: Fast Termination of the Deductive Process in Resolution Proof Systems for Non-Classical Logics. ISMIS 1994: 604-613
- [c10]
- 1993
- [j4]
- [c9]
- [c8]E. R. Harley, Zbigniew Stachniak: Minimal Resolution Proof Systems for Finitely-Valued Lukasiewicz Logics. ISMVL 1993: 54-59
- 1992
- [j3]Zbigniew Stachniak: Resolution Approximation of First-Order Logics. Inf. Comput. 96(2): 225-244 (1992)
- [j2]Peter W. O'Hearn, Zbigniew Stachniak: Resolution Framework for Finitely-Valued First-Order Logics. J. Symb. Comput. 13(3): 235-254 (1992)
- 1991
- [j1]
- [c7]
- 1990
- [c6]
- [c5]
- [c4]Zbigniew Stachniak: Note on Effective Constructibility of Resolution Proof Systems. JELIA 1990: 487-498
1980 – 1989
- 1989
- [c3]Peter W. O'Hearn, Zbigniew Stachniak: Note on Theorem Proving Strategies for Resolution Counterparts of Non-Classical Logics. ISSAC 1989: 364-372
- [c2]Peter W. O'Hearn, Zbigniew Stachniak: A Resolution Framework for Finitely-Valued First-Order Logics. SCAI 1989: 69-81
- 1988
- [c1]Zbigniew Stachniak: The resolution rule: an algebraic perspective. Algebraic Logic and Universal Algebra in Computer Science 1988: 227-242
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-12 17:06 CET by the dblp team