Zbigniew Stachniak

Affiliations:
  • York University, Toronto, ON, Canada


According to our database1, Zbigniew Stachniak authored at least 43 papers between 1985 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Learning From Prototypes.
IEEE Ann. Hist. Comput., 2020

2019
Software Recovery and Beyond.
IEEE Ann. Hist. Comput., 2019

2017
MCM on Personal Software.
IEEE Ann. Hist. Comput., 2017

2015
Red Clones: The Soviet Computer Hobby Movement of the 1980s.
IEEE Ann. Hist. Comput., 2015

2014
Early Commercial Electronic Distribution of Software.
IEEE Ann. Hist. Comput., 2014

2013
This Is Not a Computer: Negotiating the Microprocessor.
IEEE Ann. Hist. Comput., 2013

2011
Depth-Driven Circuit-Level Stochastic Local Search for SAT.
Proceedings of the IJCAI 2011, 2011

2010
The MIL MF7114 Microprocessor.
IEEE Ann. Hist. Comput., 2010

Improved Local Search for Circuit Satisfiability.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

2009
Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008
Microcomputers.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Weighting strategy for non-clausal resolution.
J. Exp. Theor. Artif. Intell., 2008

Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

2007
Intel SIM8-01: A Proto-PC.
IEEE Ann. Hist. Comput., 2007

2005
Substitutional Definition of Satisfiability in Classical Propositional Logic.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

2004
A Note on Satisfying Truth-Value Assignments of Boolean Formulas.
Proceedings of the SAT 2004, 2004

Finite Algebras and AI: From Matrix Semantics to Stochastic Local Search.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2004

2003
The Making of the MCM/70 Microcomputer.
IEEE Ann. Hist. Comput., 2003

2001
Non-Clausal Reasoning with Definite Theories.
Fundam. Informaticae, 2001

Exploiting Polarity in Multiple-Valued Inference Systems.
Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic, 2001

1999
Polarity Guided Tractable Reasoning.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998
On Finitely-Valued Inference Systems.
Stud Logica, 1998

Non-clausal Reasoning with Propositional Definite Theories.
Proceedings of the Artificial Intelligence and Symbolic Computation, 1998

1996
Resolution proof systems - an algebraic theory.
Automated reasoning series 4, Kluwer, ISBN: 978-0-7923-4017-1, 1996

1995
Nonmonotonic Theories and Their Axiomatic Varieties.
J. Log. Lang. Inf., 1995

1994
Lattices of Resolution Logics.
Proceedings of the 24th IEEE International Symposium on Multiple-Valued Logic, 1994

Fast Termination of the Deductive Process in Resolution Proof Systems for Non-Classical Logics.
Proceedings of the Methodologies for Intelligent Systems, 8th International Symposium, 1994

1993
An essay on resolution logics.
Stud Logica, 1993

Minimal Resolution Proof Systems for Finitely-Valued Lukasiewicz Logics.
Proceedings of the 23rd IEEE International Symposium on Multiple-Valued Logic, 1993

Algebraic Sematics for Cumulative Inference Operations.
Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

1992
Resolution Approximation of First-Order Logics
Inf. Comput., February, 1992

Resolution Framework for Finitely-Valued First-Order Logics.
J. Symb. Comput., 1992

1991
Extending resolution to resolution logics.
J. Exp. Theor. Artif. Intell., 1991

Minimization of resolution proof systems.
Fundam. Informaticae, 1991

Note on Resolution Circuits.
Proceedings of the Methodologies for Intelligent Systems, 6th International Symposium, 1991

1990
Note on Effective Constructibility of Resolution Proof Systems.
Proceedings of the Logics in AI, European Workshop, 1990

Resolution Proof Systems with Weak Transformation Rules.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

Note on Resolution Approximation of Many-Valued Logics.
Proceedings of the 20th International Symposium on Multiple-Valued Logic, 1990

1989
Many-valued computational logics.
J. Philos. Log., 1989

Note on Theorem Proving Strategies for Resolution Counterparts of Non-Classical Logics.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1988
Two theorems on many-valued logics.
J. Philos. Log., 1988

The resolution rule: an algebraic perspective.
Proceedings of the Algebraic Logic and Universal Algebra in Computer Science, Conference, 1988

1985
Note on Structural Logics.
Math. Log. Q., 1985


  Loading...