default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZbigniew Stachniak
Person information
- affiliation: York University, Toronto, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j21]Zbigniew Stachniak:
Learning From Prototypes. IEEE Ann. Hist. Comput. 42(2): 63-71 (2020)
2010 – 2019
- 2019
- [j20]Zbigniew Stachniak:
Software Recovery and Beyond. IEEE Ann. Hist. Comput. 41(4): 110-118 (2019) - 2017
- [j19]Zbigniew Stachniak:
MCM on Personal Software. IEEE Ann. Hist. Comput. 39(1): 52-64 (2017) - 2015
- [j18]Zbigniew Stachniak:
Red Clones: The Soviet Computer Hobby Movement of the 1980s. IEEE Ann. Hist. Comput. 37(1): 12-23 (2015) - 2014
- [j17]Zbigniew Stachniak:
Early Commercial Electronic Distribution of Software. IEEE Ann. Hist. Comput. 36(1): 39-51 (2014) - 2013
- [j16]Zbigniew Stachniak:
This Is Not a Computer: Negotiating the Microprocessor. IEEE Ann. Hist. Comput. 35(4): 48-54 (2013) - 2011
- [c21]Anton Belov, Matti Järvisalo
, Zbigniew Stachniak:
Depth-Driven Circuit-Level Stochastic Local Search for SAT. IJCAI 2011: 504-509 - 2010
- [j15]Zbigniew Stachniak:
The MIL MF7114 Microprocessor. IEEE Ann. Hist. Comput. 32(4): 48-59 (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
- [j14]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]Zbigniew Stachniak:
Microcomputers. Wiley Encyclopedia of Computer Science and Engineering 2008 - 2007
- [j13]Zbigniew Stachniak:
Intel SIM8-01: A Proto-PC. IEEE Ann. Hist. Comput. 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]Zbigniew Stachniak:
A Note on Satisfying Truth-Value Assignments of Boolean Formulas. SAT 2004 - 2003
- [j12]Zbigniew Stachniak:
The Making of the MCM/70 Microcomputer. IEEE Ann. Hist. Comput. 25(2): 62-75 (2003) - 2001
- [j11]Zbigniew Stachniak:
Non-Clausal Reasoning with Definite Theories. Fundam. Informaticae 48(4): 363-388 (2001) - [c14]Zbigniew Stachniak:
Exploiting Polarity in Multiple-Valued Inference Systems. ISMVL 2001: 149-158
1990 – 1999
- 1999
- [c13]Zbigniew Stachniak:
Polarity Guided Tractable Reasoning. AAAI/IAAI 1999: 751-758 - 1998
- [j10]Zbigniew Stachniak:
On Finitely-Valued Inference Systems. Stud Logica 61(1): 149-169 (1998) - [c12]Zbigniew Stachniak:
Non-clausal Reasoning with Propositional Definite Theories. AISC 1998: 296-307 - 1996
- [b1]Zbigniew Stachniak:
Resolution proof systems - an algebraic theory. Automated reasoning series 4, Kluwer 1996, ISBN 978-0-7923-4017-1, pp. I-XVI, 1-206 - 1995
- [j9]Zbigniew Stachniak:
Nonmonotonic Theories and Their Axiomatic Varieties. J. Log. Lang. Inf. 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]Zbigniew Stachniak:
Lattices of Resolution Logics. ISMVL 1994: 108-114 - 1993
- [j8]Zbigniew Stachniak:
An essay on resolution logics. Stud Logica 52(2): 309-322 (1993) - [c9]Zbigniew Stachniak:
Algebraic Sematics for Cumulative Inference Operations. AAAI 1993: 444-449 - [c8]E. R. Harley, Zbigniew Stachniak:
Minimal Resolution Proof Systems for Finitely-Valued Lukasiewicz Logics. ISMVL 1993: 54-59 - 1992
- [j7]Zbigniew Stachniak:
Resolution Approximation of First-Order Logics. Inf. Comput. 96(2): 225-244 (1992) - [j6]Peter W. O'Hearn, Zbigniew Stachniak:
Resolution Framework for Finitely-Valued First-Order Logics. J. Symb. Comput. 13(3): 235-254 (1992) - 1991
- [j5]Zbigniew Stachniak:
Minimization of resolution proof systems. Fundam. Informaticae 14(1): 129-146 (1991) - [j4]Zbigniew Stachniak:
Extending resolution to resolution logics. J. Exp. Theor. Artif. Intell. 3(1): 17-32 (1991) - [c7]Zbigniew Stachniak:
Note on Resolution Circuits. ISMIS 1991: 620-629 - 1990
- [c6]Zbigniew Stachniak:
Note on Resolution Approximation of Many-Valued Logics. ISMVL 1990: 204-209 - [c5]Zbigniew Stachniak:
Resolution Proof Systems with Weak Transformation Rules. ISSAC 1990: 38-43 - [c4]Zbigniew Stachniak:
Note on Effective Constructibility of Resolution Proof Systems. JELIA 1990: 487-498
1980 – 1989
- 1989
- [j3]Zbigniew Stachniak:
Many-valued computational logics. J. Philos. Log. 18(3): 257-274 (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
- [j2]Zbigniew Stachniak:
Two theorems on many-valued logics. J. Philos. Log. 17(2): 171-179 (1988) - [c1]Zbigniew Stachniak:
The resolution rule: an algebraic perspective. Algebraic Logic and Universal Algebra in Computer Science 1988: 227-242 - 1985
- [j1]Zbigniew Stachniak:
Note on Structural Logics. Math. Log. Q. 31(19-20): 317-320 (1985)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
