dblp.uni-trier.dewww.uni-trier.de

Zbigniew Stachniak Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
30EEAnton Belov, Zbigniew Stachniak: Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability. SAT 2009: 258-264
2008
29EEZbigniew Stachniak, Anton Belov: Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning. SAT 2008: 257-270
28EEZbigniew Stachniak: Microcomputers. Wiley Encyclopedia of Computer Science and Engineering 2008
27EEZbigniew Stachniak, Anton Belov: Weighting strategy for non-clausal resolution. J. Exp. Theor. Artif. Intell. 20(1): 61-78 (2008)
2007
26EEZbigniew Stachniak: Intel SIM8-01: A Proto-PC. IEEE Annals of the History of Computing 29(1): 34-48 (2007)
2005
25EEAnton Belov, Zbigniew Stachniak: Substitutional Definition of Satisfiability in Classical Propositional Logic. SAT 2005: 31-45
2004
24EEZbigniew Stachniak: Finite Algebras and AI: From Matrix Semantics to Stochastic Local Search. AISC 2004: 8-14
23EEZbigniew Stachniak: A Note on Satisfying Truth-Value Assignments of Boolean Formulas. SAT 2004
2003
22EEZbigniew Stachniak: The Making of the MCM/70 Microcomputer. IEEE Annals of the History of Computing 25(2): 62-75 (2003)
2001
21 Zbigniew Stachniak: Exploiting Polarity in Multiple-Valued Inference Systems. ISMVL 2001: 149-
20 Zbigniew Stachniak: Non-Clausal Reasoning with Definite Theories. Fundam. Inform. 48(4): 363-388 (2001)
1999
19 Zbigniew Stachniak: Polarity Guided Tractable Reasoning. AAAI/IAAI 1999: 751-758
1998
18EEZbigniew Stachniak: Non-clausal Reasoning with Propositional Definite Theories. AISC 1998: 296-307
17 Zbigniew Stachniak: On Finitely-Valued Inference Systems. Studia Logica 61(1): 149-169 (1998)
1995
16 Zbigniew Stachniak: Nonmonotonic Theories and Their Axiomatic Varieties. Journal of Logic, Language and Information 4(4): 317-334 (1995)
1994
15EEZbigniew Stachniak: Fast Termination of the Deductive Process in Resolution Proof Systems for Non-Classical Logics. ISMIS 1994: 604-613
14 Zbigniew Stachniak: Lattices of Resolution Logics. ISMVL 1994: 108-114
1993
13 Zbigniew Stachniak: Algebraic Sematics for Cumulative Inference Operations. AAAI 1993: 444-449
12 E. R. Harley, Zbigniew Stachniak: Minimal Resolution Proof Systems for Finitely-Valued Lukasiewicz Logics. ISMVL 1993: 54-59
11 Zbigniew Stachniak: An essay on resolution logics. Studia Logica 52(2): 309-322 (1993)
1992
10 Zbigniew Stachniak: Resolution Approximation of First-Order Logics Inf. Comput. 96(2): 225-244 (1992)
9 Peter W. O'Hearn, Zbigniew Stachniak: Resolution Framework for Finitely-Valued First-Order Logics. J. Symb. Comput. 13(3): 235-254 (1992)
1991
8EEZbigniew Stachniak: Note on Resolution Circuits. ISMIS 1991: 620-629
7 Zbigniew Stachniak: Minimization of resolution proof systems. Fundam. Inform. 14(1): 129-146 (1991)
1990
6 Zbigniew Stachniak: Note on Resolution Approximation of Many-Valued Logics. ISMVL 1990: 204-209
5EEZbigniew Stachniak: Resolution Proof Systems with Weak Transformation Rules. ISSAC 1990: 38-43
4EEZbigniew Stachniak: Note on Effective Constructibility of Resolution Proof Systems. JELIA 1990: 487-498
1989
3EEPeter W. O'Hearn, Zbigniew Stachniak: Note on Theorem Proving Strategies for Resolution Counterparts of Non-Classical Logics. ISSAC 1989: 364-372
2 Peter W. O'Hearn, Zbigniew Stachniak: A Resolution Framework for Finitely-Valued First-Order Logics. SCAI 1989: 69-81
1988
1EEZbigniew Stachniak: The resolution rule: an algebraic perspective. Algebraic Logic and Universal Algebra in Computer Science 1988: 227-242

Coauthor Index

1Anton Belov [25] [27] [29] [30]
2E. R. Harley [12]
3Peter W. O'Hearn [2] [3] [9]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)