default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBeata Konikowska
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i1]Wojciech Jamroga, Beata Konikowska, Damian Kurpiewski, Wojciech Penczek:
Multi-Valued Verification of Strategic Ability. CoRR abs/2310.20344 (2023)- 2020
- [j25]Wojciech Jamroga
, Beata Konikowska, Damian Kurpiewski, Wojciech Penczek:
Multi-valued Verification of Strategic Ability. Fundam. Informaticae 175(1-4): 207-251 (2020)
2010 – 2019
- 2019
- [j24]Beata Konikowska, Arnon Avron:
Reasoning about Covering-based Rough Sets Using Three Truth Values. FLAP 6(2): 361-382 (2019) - 2016
- [j23]Ofer Arieli, Beata Konikowska, Alexander Rabinovich, Anna Zamansky:
Foreword. J. Log. Comput. 26(1): 1-6 (2016) - [c11]Wojciech Jamroga, Beata Konikowska, Wojciech Penczek:
Multi-Valued Verification of Strategic Ability. AAMAS 2016: 1180-1189 - 2015
- [j22]Arnon Avron, Beata Konikowska, Anna Zamansky:
Efficient reasoning with inconsistent information using C-systems. Inf. Sci. 296: 219-236 (2015) - 2013
- [j21]Arnon Avron, Beata Konikowska, Anna Zamansky:
Cut-free sequent calculi for C-systems with generalized finite-valued semantics. J. Log. Comput. 23(3): 517-540 (2013) - [p2]Beata Konikowska:
Three-Valued Logic for Reasoning about Covering-Based Rough Sets. Rough Sets and Intelligent Systems (1) 2013: 439-461 - 2012
- [j20]Arnon Avron, Beata Konikowska:
Finite-valued Logics for Information Processing. Fundam. Informaticae 114(1): 1-30 (2012) - [c10]Arnon Avron, Beata Konikowska, Anna Zamansky:
Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics. LICS 2012: 85-94 - 2010
- [c9]Arnon Avron, Jonathan Ben-Naim, Beata Konikowska:
Logics of Reasonable Information Sources. ISMVL 2010: 61-66
2000 – 2009
- 2009
- [j19]Arnon Avron, Beata Konikowska:
Proof Systems for Reasoning about Computation Errors. Stud Logica 91(2): 273-293 (2009) - [p1]Arnon Avron, Jonathan Ben-Naim, Beata Konikowska:
Processing Information from a Set of Sources. Towards Mathematical Philosophy 2009: 165-186 - 2008
- [j18]Arnon Avron, Beata Konikowska:
Rough Sets and 3-Valued Logics. Stud Logica 90(1): 69-92 (2008) - 2007
- [j17]Ivo Düntsch, Beata Konikowska:
A Multi-modal Logic for Disagreement and Exhaustiveness. Fundam. Informaticae 75(1-4): 215-238 (2007) - [j16]Arnon Avron, Jonathan Ben-Naim, Beata Konikowska:
Cut-Free Ordinary Sequent Calculi for Logics Having Generalized Finite-Valued Semantics. Logica Universalis 1(1): 41-70 (2007) - 2006
- [c8]Beata Konikowska, Wojciech Penczek:
Model checking for multivalued logic of knowledge and time. AAMAS 2006: 169-176 - 2005
- [j15]Arnon Avron, Beata Konikowska:
Multi-valued Calculi for Logics Based on Non-determinism. Log. J. IGPL 13(4): 365-387 (2005) - [j14]Beata Konikowska:
A Decompositional Deduction System for a Logic Featuring Inconsistency and Uncertainty. J. Appl. Non Class. Logics 15(1): 25-44 (2005) - 2004
- [j13]Beata Konikowska, Wojciech Penczek:
On Designated Values in Multi-valued CTL* Model Checking. Fundam. Informaticae 60(1-4): 211-224 (2004) - 2002
- [j12]Beata Konikowska:
Rasiowa-Sikorski deduction systems in computer science applications. Theor. Comput. Sci. 286(2): 323-366 (2002) - [c7]Beata Konikowska, Wojciech Penczek:
Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}. CONCUR 2002: 226-239 - 2001
- [j11]Arnon Avron, Beata Konikowska:
Decomposition Proof Systems for Gödel-Dummett Logics. Stud Logica 69(2): 197-219 (2001) - 2000
- [j10]Ivo Düntsch, Beata Konikowska:
A multimodal logic for reasoning about complementarity. J. Appl. Non Class. Logics 10(3-4): 273-301 (2000)
1990 – 1999
- 1999
- [j9]Beata Konikowska, Marcin Bialasik:
Reasoning with First Order Nondeterministic Specifications. Acta Informatica 36(5): 375-403 (1999) - 1998
- [j8]Beata Konikowska, Charles G. Morgan, Ewa Orlowska:
A Relational Formalisation of Arbitrary Finite Valued Logics. Log. J. IGPL 6(5): 755-774 (1998) - [c6]Beata Konikowska, Charles G. Morgan, Ewa Orlowska:
Relational semantics for arbitrary finite valued logics. RelMiCS 1998: 138-143 - [c5]Stéphane Demri, Beata Konikowska:
Relative Similarity Logics are Decidable: Reduction to FO2 with Equality. JELIA 1998: 279-293 - [c4]Beata Konikowska:
Rasiowa-Sikorski Deduction Systems: A Handy Tool for Computer Science Logics. WADT 1998: 183-197 - 1997
- [j7]Beata Konikowska:
A Logic for Reasoning about Relative Similarity. Stud Logica 58(1): 185-226 (1997) - 1996
- [j6]Beata Konikowska:
McCarthy Algebras: A Model of McCarthy's Logical Calculus. Fundam. Informaticae 26(2): 167-203 (1996) - 1993
- [j5]Beata Konikowska:
Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus. J. Appl. Non Class. Logics 3(1): 39-71 (1993) - 1991
- [j4]Beata Konikowska, Andrzej Tarlecki, Andrzej Blikle:
A three-valued logic for software specification and validation. Fundam. Informaticae 14(4): 411-453 (1991) - [c3]Beata Konikowska:
Two Over Three: A Two-Valued Logic for Software Specification and Validation Over a Three-Valued Predicate Calculus. MFCS 1991: 277-286 - 1990
- [j3]Beata Konikowska:
A two-valued logic for reasoning about different types of consequence in Kleene's three-valued logic. Stud Logica 49(4): 541-555 (1990)
1980 – 1989
- 1988
- [c2]Beata Konikowska, Andrzej Tarlecki, Andrzej Blikle:
A Three-Valued Logic for Software Specification and Validation. VDM Europe 1988: 218-242 - 1985
- [j2]Beata Konikowska:
A query language allowing conditions of relational type queries. Inf. Syst. 10(1): 113-125 (1985)
1970 – 1979
- 1974
- [c1]Beata Konikowska:
On Some Approximation Problems of Continuous Computation. MFCS 1974: 91-106 - 1973
- [j1]Beata Konikowska:
Continuous Machines. Inf. Control. 22(4): 353-372 (1973)
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-25 05:50 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:
