default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Walicki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j18]Michal Walicki:
Extensions in graph normal form. Log. J. IGPL 30(1): 101-123 (2022)
2010 – 2019
- 2019
- [j17]Michal Walicki:
Kernels of digraphs with finitely many ends. Discret. Math. 342(2): 473-486 (2019) - [i1]Michal Walicki, Sjur K. Dyrkolbotn:
Paraconsistency, resolution and relevance. CoRR abs/1906.03476 (2019) - 2017
- [j16]Michal Walicki:
Resolving Infinitary Paradoxes. J. Symb. Log. 82(2): 709-723 (2017) - 2014
- [j15]Sjur K. Dyrkolbotn, Michal Walicki:
Propositional discourse logic. Synth. 191(5): 863-899 (2014) - 2012
- [j14]Marc Bezem, Clemens Grabmayer, Michal Walicki:
Expressive power of digraph solvability. Ann. Pure Appl. Log. 163(3): 200-213 (2012) - [j13]Sjur K. Dyrkolbotn, Michal Walicki:
Kernels in digraphs that are not kernel perfect. Discret. Math. 312(16): 2498-2505 (2012) - [j12]Michal Walicki, Sjur K. Dyrkolbotn:
Finding kernels or solving SAT. J. Discrete Algorithms 10: 146-164 (2012) - 2011
- [j11]Michal Walicki, Diogo R. Ferreira
:
Sequence partitioning for process mining with unlabeled event logs. Data Knowl. Eng. 70(10): 821-841 (2011) - 2010
- [c19]Michal Walicki, Diogo R. Ferreira:
Mining sequences for patterns with non-repeating symbols. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2009
- [j10]Michal Walicki, Marc Bezem, Wojtek Szajnkenig:
Developing Bounded Reasoning. J. Log. Lang. Inf. 18(1): 97-129 (2009) - [j9]Michal Walicki:
Reference, paradoxes and truth. Synth. 171(1): 195-226 (2009) - 2008
- [j8]Thomas Ågotnes, Michal Walicki:
Complete Axiomatisations of Properties of Finite Sets. Log. J. IGPL 16(3): 293-313 (2008) - 2007
- [c18]Marc Bezem, Tore Langholm, Michal Walicki:
Completeness and Decidability in Sequence Logic. LPAR 2007: 123-137 - 2006
- [j7]Yngve Lamo, Michal Walicki:
Quantifier-free logic for nondeterministic theories. Theor. Comput. Sci. 355(2): 215-227 (2006) - 2005
- [c17]Thomas Ågotnes, Michal Walicki:
A logic of reasoning, communication and cooperation with syntactic knowledge. AAMAS 2005: 1135-1136 - [c16]Michal Walicki:
Bireachability and Final Multialgebras. CALCO 2005: 408-423 - [c15]Thomas Ågotnes, Michal Walicki:
Strongly Complete Axiomatizations of "Knowing at Most" in Syntactic Structures. CLIMA 2005: 57-76 - [c14]Thomas Ågotnes, Michal Walicki:
Complete Axiomatizations of Finite Syntactic Epistemic States. DALT 2005: 33-50 - 2003
- [c13]Yngve Lamo, Michal Walicki:
Quantifier-free logic for multialgebraic theories. WoLLIC 2003: 141-153 - 2002
- [c12]Yngve Lamo, Michal Walicki:
Combining Specification Formalisms in the ?General Logic? of Multialgebras. WADT 2002: 328-342 - [c11]Yngve Lamo, Michal Walicki:
Composition and refinement of specifications and parameterised data types. Refine 2002: 199-216 - 2001
- [j6]Michal Walicki, Magne Haveraaen, Sigurd Meldal:
Computation Algebras. Math. Struct. Comput. Sci. 11(5): 597-636 (2001) - [j5]Yngve Lamo, Michal Walicki:
Specification of Parametrized Programs - Persistency Revisited. Nord. J. Comput. 8(3): 298-323 (2001) - [c10]Michal Walicki, Adis Hodzic, Sigurd Meldal:
Compositional Homomorphisms of Relational Structures. FCT 2001: 359-371 - [c9]Yngve Lamo, Michal Walicki:
Modeling Partiality by Nondeterminism. ISAS-SCI (1) 2001: 447-452 - [c8]Michal Walicki, Sigurd Meldal:
Nondeterminism vs. Underspecification. ISAS-SCI (1) 2001: 551-555
1990 – 1999
- 1997
- [j4]Michal Walicki, Sigurd Meldal:
Algebraic Approaches to Nondeterminism: An Overview. ACM Comput. Surv. 29(1): 30-81 (1997) - [j3]Michal Walicki, Sigurd Meldal:
Singular and Plural Nondeterministic Parameters. SIAM J. Comput. 26(4): 991-1005 (1997) - [c7]Michal Walicki, Marcin Bialasik:
Categories of relational structures. WADT 1997: 418-434 - 1995
- [j2]Michal Walicki, Manfred Broy:
Structured Specifications and Implementation of Nondeterministic Data Types. Nord. J. Comput. 2(3): 358-395 (1995) - [j1]Michal Walicki, Sigurd Meldal:
A Complete Calculus for the Multialgebraic and Functional Semantics of Nondeterminism. ACM Trans. Program. Lang. Syst. 17(2): 366-393 (1995) - [c6]Valentinas Kriauciukas, Michal Walicki:
Rewriting and Reasoning with Set-Relations II: The Non-ground Case Completeness. COMPASS/ADT 1995: 306-321 - [c5]Michal Walicki, Sigurd Meldal:
Generated Models and the omega-Rule: The Nondeterministic Case. TAPSOFT 1995: 424-438 - 1994
- [c4]Michal Walicki, Sigurd Meldal:
Multialgebras, Power Algebras and Complete Calculi of Identities and Inclusions. COMPASS/ADT 1994: 453-468 - [c3]Valentinas Kriauciukas, Michal Walicki:
Reasoning and Rewriting with Set-Relations I: Ground Completeness. CSL 1994: 264-278 - [c2]Aida Pliuskeviciene, Regimantas Pliuskevicius, Michal Walicki, Sigurd Meldal:
On Specialization of Derivations in Axiomatic Equality Theories. LFCS 1994: 291-303 - 1993
- [c1]Michal Walicki, Sigurd Meldal:
Sets and Nondeterminism. ICLP Workshop on Logic Programming with Sets 1993
Coauthor Index
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:07 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:
