default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Szalas
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j57]Patrick Doherty, Andrzej Szalas
:
Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions. Artif. Intell. 326: 104036 (2024)- [j56]Barbara Dunin-Keplicz, Andrzej Szalas:
Modeling and shadowing paraconsistent BDI agents. Ann. Math. Artif. Intell. 92(4): 855-876 (2024) - [j55]Mohua Banerjee, Mihir K. Chakraborty, Andrzej Szalas:
Logics from rough sets. J. Appl. Non Class. Logics 34(2-3): 171-173 (2024) - [i5]Patrick Doherty, Andrzej Szalas:
Techniques for Measuring the Inferential Strength of Forgetting Policies. CoRR abs/2404.02454 (2024) - 2023
- [i4]Patrick Doherty, Andrzej Szalas:
Dual Forgetting Operators in the Context of Weakest Sufficient and Strongest Necessary Conditions. CoRR abs/2305.07233 (2023) - 2022
- [j54]Patrick Doherty, Andrzej Szalas:
A landscape and implementation framework for probabilistic rough sets using ProbLog. Inf. Sci. 593: 546-576 (2022) - [c66]Andrzej Szalas:
Querying and Reasoning in Paraconsistent Rule-Object Languages with Inheritance Expressions. ICCCI 2022: 396-409 - [c65]Andrzej Szalas:
Inheriting and Fusing Beliefs of Logically Heterogeneous Objects. KES 2022: 299-308 - 2021
- [j53]Patrick Doherty, Andrzej Szalas:
Rough set reasoning using answer set programs. Int. J. Approx. Reason. 130: 126-149 (2021) - [c64]Linh Anh Nguyen, Andrzej Szalas:
Optimization Models for Medical Procedures Relocation. KES 2021: 2058-2067 - [c63]Andrzej Szalas:
Many-Valued Dynamic Object-Oriented Inheritance and Approximations. IJCRS 2021: 103-119 - 2020
- [j52]Andrzej Szalas:
A Paraconsistent ASP-Like Language with Tractable Model Generation. FLAP 7(3): 361-389 (2020) - [j51]Andrzej Szalas:
On the Probability and Cost of Ignorance, Inconsistency, Nonsense and More. J. Multiple Valued Log. Soft Comput. 34(5-6): 423-450 (2020) - [c62]Barbara Dunin-Keplicz, Andrzej Szalas:
Shadowing in Many-Valued Nested Structures. ISMVL 2020: 230-236 - [c61]Andrzej Szalas:
Revisiting Object-Rule Fusion in Query Languages. KES 2020: 50-59 - [c60]Barbara Dunin-Keplicz, Andrzej Szalas:
A Framework for Organization-Centered Doxastic Reasoning. KES 2020: 3019-3028 - [c59]Patrick Doherty, Andrzej Szalas:
Rough Forgetting. IJCRS 2020: 3-18
2010 – 2019
- 2019
- [j50]Lukasz Bialek, Barbara Dunin-Keplicz, Andrzej Szalas:
A paraconsistent approach to actions in informationally complex environments. Ann. Math. Artif. Intell. 86(4): 231-255 (2019) - [j49]Jacek Szklarski, Lukasz Bialek, Andrzej Szalas:
Paraconsistent Reasoning in Cops and Robber Game with Uncertain Information: A Simulation-Based Analysis. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 27(3): 429-455 (2019) - [c58]Andrzej Szalas:
Decision-Making Support Using Nonmonotonic Probabilistic Reasoning. KES-IDT (1) 2019: 39-51 - [c57]Barbara Dunin-Keplicz, Inga Rüb, Andrzej Szalas:
Doxastic Group Reasoning via Multiple Belief Shadowing. PRIMA 2019: 271-288 - [i3]Andrzej Szalas:
A Paraconsistent ASP-like Language with Tractable Model Generation. CoRR abs/1912.09715 (2019) - 2018
- [j48]Francesco Luca De Angelis, Giovanna Di Marzo Serugendo, Andrzej Szalas:
Paraconsistent Rule-based Reasoning with Graded Truth Values. FLAP 5(1): 185-220 (2018) - [c56]Lukasz Bialek, Barbara Dunin-Keplicz, Andrzej Szalas:
Belief Shadowing. EMAS@AAMAS 2018: 158-180 - 2017
- [c55]Lukasz Bialek, Barbara Dunin-Keplicz, Andrzej Szalas:
Towards a Paraconsistent Approach to Actions in Distributed Information-Rich Environments. IDC 2017: 49-60 - [c54]Lukasz Bialek, Barbara Dunin-Keplicz, Andrzej Szalas:
Rule-Based Reasoning with Belief Structures. ISMIS 2017: 229-239 - [c53]Francesco Luca De Angelis, Giovanna Di Marzo Serugendo, Barbara Dunin-Keplicz, Andrzej Szalas:
Heterogeneous Approximate Reasoning with Graded Truth Values. IJCRS (1) 2017: 61-82 - 2016
- [c52]Patrick Doherty, Jonas Kvarnström, Andrzej Szalas:
Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs - (Extended Abstract). JELIA 2016: 536-542 - [c51]Patrick Doherty, Andrzej Szalas:
An Entailment Procedure for Kleene Answer Set Programs. MIWAI 2016: 24-37 - 2015
- [j47]Linh Anh Nguyen, Thi-Bich-Loc Nguyen, Andrzej Szalas:
Towards richer rule languages with polynomial data complexity for the Semantic Web. Data Knowl. Eng. 96: 57-77 (2015) - [j46]Barbara Dunin-Keplicz, Alina Strachocka, Andrzej Szalas, Rineke Verbrugge:
Paraconsistent semantics of speech acts. Neurocomputing 151: 943-952 (2015) - [c50]Patrick Doherty, Andrzej Szalas:
Stability, Supportedness, Minimality and Kleene Answer Set Programs. Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation 2015: 125-140 - 2014
- [j45]Son Thanh Cao, Linh Anh Nguyen, Andrzej Szalas:
The Web Ontology Rule Language OWL 2 RL + and Its Extensions. Trans. Comput. Collect. Intell. 13: 152-175 (2014) - [j44]Son Thanh Cao, Linh Anh Nguyen, Andrzej Szalas:
WORL: a nonmonotonic rule language for the semantic web. Vietnam. J. Comput. Sci. 1(1): 57-69 (2014) - [c49]Barbara Dunin-Keplicz, Andrzej Szalas, Rineke Verbrugge:
Tractable Reasoning about Group Beliefs. EMAS@AAMAS 2014: 328-350 - [c48]Andrzej Szalas:
Symbolic Explanations of Generalized Fuzzy Reasoning. IDT/IIMSS/STET 2014: 7-16 - [c47]Barbara Dunin-Keplicz, Andrzej Szalas:
Indeterministic Belief Structures. KES-AMSTA 2014: 57-66 - [c46]Lukasz Bialek, Andrzej Szalas:
Lightweight Reasoning with Incomplete and Inconsistent Information: A Case Study. WI-IAT (3) 2014: 325-332 - 2013
- [j43]Patrick Doherty, Andrzej Szalas:
Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination. Fundam. Informaticae 127(1-4): 135-149 (2013) - [j42]Andrzej Szalas:
How an agent might think. Log. J. IGPL 21(3): 515-535 (2013) - [j41]Barbara Dunin-Keplicz, Andrzej Szalas:
Taming Complex Beliefs. Trans. Comput. Collect. Intell. 11: 1-21 (2013) - [c45]Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas:
Horn-TeamLog: A Horn Fragment of TeamLog with PTime Data Complexity. ICCCI 2013: 143-153 - [c44]Jan Maluszynski, Andrzej Szalas:
Partiality and Inconsistency in Agents' Belief Bases. KES-AMSTA 2013: 3-17 - [c43]Linh Anh Nguyen, Andrzej Szalas:
On the Horn Fragments of Serial Regular Grammar Logics with Converse. KES-AMSTA 2013: 225-234 - [c42]Barbara Dunin-Keplicz, Alina Strachocka, Andrzej Szalas, Rineke Verbrugge:
Perceiving Speech Acts under Incomplete and Inconsistent Information. KES-AMSTA 2013: 255-264 - [c41]Linh Anh Nguyen, Thi-Bich-Loc Nguyen, Andrzej Szalas:
On Horn Knowledge Bases in Regular Description Logic with Inverse. KSE (1) 2013: 37-49 - [c40]Linh Anh Nguyen, Thi-Bich-Loc Nguyen, Andrzej Szalas:
HornDL: An Expressive Horn Description Logic with PTime Data Complexity. RR 2013: 259-264 - [p4]Linh Anh Nguyen, Andrzej Szalas:
Logic-Based Roughification. Rough Sets and Intelligent Systems (1) 2013: 517-543 - 2012
- [j40]Linh Anh Nguyen, Andrzej Szalas:
Paraconsistent Reasoning for Semantic Web Agents. Trans. Comput. Collect. Intell. 6: 36-55 (2012) - [c39]Barbara Dunin-Keplicz, Andrzej Szalas:
Distributed Paraconsistent Belief Fusion. IDC 2012: 59-69 - [c38]Barbara Dunin-Keplicz, Andrzej Szalas:
Epistemic Profiles and Belief Structures. KES-AMSTA 2012: 360-369 - [c37]Patrick Doherty, Jonas Kvarnström, Andrzej Szalas:
Temporal Composite Actions with Constraints. KR 2012 - [c36]Thanh-Luong Tran, Quang-Thuy Ha, Thi-Lan-Giao Hoang, Linh Anh Nguyen, Hung Son Nguyen, Andrzej Szalas:
Concept Learning for Description Logic-Based Information Systems. KSE 2012: 65-73 - [c35]Quang-Thuy Ha, Thi-Lan-Giao Hoang, Linh Anh Nguyen, Hung Son Nguyen, Andrzej Szalas, Thanh-Luong Tran:
A bisimulation-based method of concept learning for knowledge bases in description logics. SoICT 2012: 241-249 - [p3]Barbara Dunin-Keplicz, Andrzej Szalas:
Agents in Approximate Environments. Games, Actions and Social Software 2012: 141-163 - 2011
- [j39]Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas:
Converse-PDL with regular inclusion axioms: a framework for MAS logics. J. Appl. Non Class. Logics 21(1): 61-91 (2011) - [j38]Jan Maluszynski, Andrzej Szalas:
Logical foundations and complexity of 4QL, a query language with unrestricted negation. J. Appl. Non Class. Logics 21(2): 211-232 (2011) - [j37]Linh Anh Nguyen, Andrzej Szalas:
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse. Stud Logica 98(3): 387-428 (2011) - [c34]Patrick Doherty, Barbara Dunin-Keplicz, Andrzej Szalas:
Tractable model checking for fragments of higher-order coalition logic. AAMAS 2011: 743-750 - [c33]Son Thanh Cao, Linh Anh Nguyen, Andrzej Szalas:
On the Web Ontology Rule Language OWL 2 RL. ICCCI (1) 2011: 254-264 - [c32]Patrick Doherty, Tomasz P. Michalak, Jacek Sroka, Andrzej Szalas:
Contextual Coalitional Games. ICLA 2011: 65-78 - [c31]Son Thanh Cao, Linh Anh Nguyen, Andrzej Szalas:
WORL: A Web Ontology Rule Language. KSE 2011: 32-39 - 2010
- [j36]Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas:
A layered rule-based architecture for approximate knowledge fusion? Comput. Sci. Inf. Syst. 7(3): 617-642 (2010) - [j35]Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas:
A Framework for Graded Beliefs, Goals and Intentions. Fundam. Informaticae 100(1-4): 53-76 (2010) - [j34]Linh Anh Nguyen, Andrzej Szalas:
Checking Consistency of an ABox w.r.t. Global Assumptions in PDL. Fundam. Informaticae 102(1): 97-113 (2010) - [j33]Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas:
Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic. Int. J. Approx. Reason. 51(3): 346-362 (2010) - [j32]Linh Anh Nguyen, Andrzej Szalas:
Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH. Trans. Comput. Collect. Intell. 1: 21-38 (2010) - [c30]Jan Maluszynski, Andrzej Szalas:
Living with Inconsistency and Taming Nonmonotonicity. Datalog 2010: 384-398 - [c29]Linh Anh Nguyen, Andrzej Szalas:
Three-Valued Paraconsistent Reasoning for Semantic Web Agents. KES-AMSTA (1) 2010: 152-162 - [c28]Patrick Doherty, Andrzej Szalas:
On the Correctness of Rough-Set Based Approximate Reasoning. RSCTC 2010: 327-336 - [i2]Jan Maluszynski, Andrzej Szalas:
Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation. CoRR abs/1011.5105 (2010)
2000 – 2009
- 2009
- [j31]Aida Vitória, Jan Maluszynski, Andrzej Szalas:
Modeling and Reasoning with Paraconsistent Rough Sets. Fundam. Informaticae 97(4): 405-438 (2009) - [j30]Dov M. Gabbay, Andrzej Szalas:
Voting by Eliminating Quantifiers. Stud Logica 92(3): 365-379 (2009) - [j29]Dov M. Gabbay, Andrzej Szalas:
Annotation Theories over Finite Graphs. Stud Logica 93(2-3): 147-180 (2009) - [c27]Alicja S. Szalas, Andrzej Szalas:
Paraconsistent Reasoning with Words. Aspects of Natural Language Processing 2009: 43-58 - [c26]Linh Anh Nguyen, Andrzej Szalas:
A Tableau Calculus for Regular Grammar Logics with Converse. CADE 2009: 421-436 - [c25]Linh Anh Nguyen, Andrzej Szalas:
ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC\mathcal{ALC}. ICCCI 2009: 437-448 - [c24]Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas:
Fusing Approximate Knowledge from Distributed Sources. IDC 2009: 75-86 - [i1]Linh Anh Nguyen, Andrzej Szalas:
Optimal Tableau Decision Procedures for PDL. CoRR abs/0904.0721 (2009) - 2008
- [b2]Dov M. Gabbay, Renate A. Schmidt, Andrzej Szalas:
Second-Order Quantifier Elimination - Foundations, Computational Aspects and Applications. Studies in logic : Mathematical logic and foundations 12, College Publications 2008, ISBN 978-1-904987-56-7, pp. I-VIII, 1-308 - [j28]Andrzej Szalas:
Towards incorporating background theories into quantifier elimination. J. Appl. Non Class. Logics 18(2-3): 325-340 (2008) - [c23]Patrick Doherty, Andrzej Szalas:
Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription. KR 2008: 560-570 - [c22]Jan Maluszynski, Andrzej Szalas, Aida Vitória:
Paraconsistent Logic Programs with Four-Valued Rough Sets. RSCTC 2008: 41-51 - [c21]Aida Vitória, Andrzej Szalas, Jan Maluszynski:
Four-Valued Extension of Rough Sets. RSKT 2008: 106-114 - 2007
- [j27]Patrick Doherty, Andrzej Szalas:
A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning. Fundam. Informaticae 75(1-4): 179-193 (2007) - [j26]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Communication between agents with heterogeneous perceptual capabilities. Inf. Fusion 8(1): 56-69 (2007) - [j25]Dov M. Gabbay, Andrzej Szalas:
Second-Order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals. Stud Logica 87(1): 37-50 (2007) - [j24]Jan Maluszynski, Andrzej Szalas, Aida Vitória:
A Four-Valued Logic for Rough Set-Like Approximate Reasoning. Trans. Rough Sets 6: 176-190 (2007) - [c20]Barbara Dunin-Keplicz, Andrzej Szalas:
Towards Approximate BGI Systems. CEEMAS 2007: 277-287 - [c19]Patrick Doherty, Barbara Dunin-Keplicz, Andrzej Szalas:
Dynamics of Approximate Information Fusion. RSEISP 2007: 668-677 - 2006
- [b1]Patrick Doherty, Witold Lukaszewicz, Andrzej Skowron, Andrzej Szalas:
Knowledge Representation Techniques - A Rough Set Approach. Studies in Fuzziness and Soft Computing 202, Springer 2006, ISBN 978-3-540-33518-4, pp. 3-320 [contents] - [j23]Patrick Doherty, Martin Magnusson, Andrzej Szalas:
Approximate databases: a support tool for approximate reasoning. J. Appl. Non Class. Logics 16(1-2): 87-118 (2006) - [j22]Andrzej Szalas:
Second-order reasoning in description logics. J. Appl. Non Class. Logics 16(3-4): 517-530 (2006) - [c18]Andrzej Szalas, Jerzy Tyszkiewicz:
On the Fixpoint Theory of Equality and Its Applications. RelMiCS 2006: 388-401 - 2005
- [c17]Ewa Orlowska, Andrzej Szalas:
Quantifier Elimination in Elementary Set Theory. RelMiCS 2005: 237-248 - [c16]Michal Grabowski, Andrzej Szalas:
A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies. AWIC 2005: 183-189 - [c15]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Similarity, Approximations and Vagueness. RSFDGrC (1) 2005: 541-550 - 2004
- [c14]Patrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szalas:
Towards a Logical Analysis of Biochemical Reactions. ECAI 2004: 997-998 - [c13]Patrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szalas:
Towards a Logical Analysis of Biochemical Pathways. JELIA 2004: 667-679 - [c12]Patrick Doherty, Andrzej Szalas, Witold Lukaszewicz:
Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities. KR 2004: 459-468 - [c11]Patrick Doherty, Andrzej Szalas:
On the Correspondence between Approximations and Similarity. Rough Sets and Current Trends in Computing 2004: 143-152 - [p2]Patrick Doherty, Witold Lukaszewicz, Andrzej Skowron, Andrzej Szalas:
Approximation Transducers and Trees: A Technique for Combining Rough and Crisp Knowledge. Rough-Neural Computing: Techniques for Computing with Words 2004: 189-218 - [p1]Patrick Doherty, Jaroslaw Kachniarz, Andrzej Szalas:
Using Contextually Closed Queries for Local Closed-World Reasoning in Rough Knowledge Databases. Rough-Neural Computing: Techniques for Computing with Words 2004: 219-250 - 2003
- [j21]Patrick Doherty, Michal Grabowski, Witold Lukaszewicz, Andrzej Szalas:
Towards a Framework for Approximate Ontologies. Fundam. Informaticae 57(2-4): 147-165 (2003) - [j20]Patrick Doherty, Andrzej Skowron, Witold Lukaszewicz, Andrzej Szalas:
Preface. Fundam. Informaticae 57(2-4) (2003) - [c10]Andrzej Szalas:
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems. FCT 2003: 423-431 - [c9]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Tolerance Spaces and Approximative Representational Structures. KI 2003: 475-489 - [c8]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Information Granules for Intelligent Knowledge Structures. RSFDGrC 2003: 405-412 - 2002
- [c7]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
CAKE: A Computer-Aided Knowledge Engineering Technique. ECAI 2002: 220-224 - [c6]Andrzej Szalas:
Second-Order Quantifier Elimination in Modal Contexts. JELIA 2002: 223-232 - 2001
- [c5]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas. IJCAI 2001: 145-154 - 2000
- [c4]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Efficient Reasoning Using the Local Closed-World Assumption. AIMSA 2000: 49-58
1990 – 1999
- 1999
- [j19]Patrick Doherty, Jaroslaw Kachniarz, Andrzej Szalas:
Meta-Queries on Deductive Databases. Fundam. Informaticae 40(1): 7-30 (1999) - [j18]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Declarative PTIME Queries for Relational Databases using Quantifier Elimination. J. Log. Comput. 9(5): 737-758 (1999) - 1998
- [j17]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
General Domain Circumscription and its Effective Reductions. Fundam. Informaticae 36(1): 23-55 (1998) - [e2]Ewa Orlowska, Andrzej Szalas:
Participants Copies for Relational Methods in Logic, Algebra and Computer Science, 4th International Seminar RelMiCS, Warsaw, Poland, September 14-20, 1998. 1998 [contents] - 1997
- [j16]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Computing Circumscription Revisited: A Reduction Algorithm. J. Autom. Reason. 18(3): 297-336 (1997) - 1996
- [j15]Andrzej Szalas:
On Natural Deduction in First-Ortder Fixpoint Logics. Fundam. Informaticae 26(1): 81-94 (1996) - [j14]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
A Reduction Result for Circumscribed Semi-Horn Formulas. Fundam. Informaticae 28(3-4): 261-271 (1996) - [c3]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
General Domain Circumscription in its First-Order Reduction. FAPR 1996: 93-109 - [c2]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Explaining Explanation Closure. ISMIS 1996: 521-530 - [e1]Wojciech Penczek, Andrzej Szalas:
Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings. Lecture Notes in Computer Science 1113, Springer 1996, ISBN 3-540-61550-4 [contents] - 1995
- [c1]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Computing Circumscription Revisited: Preliminary Report. IJCAI 1995: 1502-1508 - 1994
- [j13]Andrzej Szalas:
On an Automated Translation of Modal Proof Rules into Formulas of the Classical Logic. J. Appl. Non Class. Logics 4(2): 119-127 (1994) - 1993
- [j12]Andrzej Szalas:
On the Correspondence between Modal and Classical Logic: An Automated Approach. J. Log. Comput. 3(6): 605-620 (1993) - 1992
- [j11]Andrzej Szalas:
Axiomatizing Fixpoint Logics. Inf. Process. Lett. 41(4): 175-180 (1992) - 1991
- [j10]Andrzej Szalas:
On Strictly Arithmetical Completeness in Logics of Programs. Theor. Comput. Sci. 79(2): 341-355 (1991)
1980 – 1989
- 1988
- [j9]Leszek Holenderski, Andrzej Szalas:
Propositional Description of Finite Cause-Effect Structures. Inf. Process. Lett. 27(3): 111-117 (1988) - [j8]Andrzej Szalas:
An Incompleteness Result in Process Algebra. Inf. Process. Lett. 29(2): 67-70 (1988) - [j7]Andrzej Szalas, Leszek Holenderski:
Incompleteness of First-Order Temporal Logic with Until. Theor. Comput. Sci. 57: 317-325 (1988) - 1987
- [j6]Andrzej Szalas:
Arithmetical Axiomatization of First-Order Temporal Logic. Inf. Process. Lett. 26(3): 111-116 (1987) - [j5]Andrzej Szalas:
A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time. Theor. Comput. Sci. 54: 199-214 (1987) - 1986
- [j4]Andrzej Szalas:
Concerning the Semantic Consequence Relation in First-Order Temporal Logic. Theor. Comput. Sci. 47(3): 329-334 (1986) - 1985
- [j3]Uwe Petermann, Andrzej Szalas:
A note on PCI: distributed processes communicating by interrupts. ACM SIGPLAN Notices 20(3): 37-47 (1985) - [j2]Andrzej Szalas, Danuta Szczepanska:
Exception handling in parallel computations. ACM SIGPLAN Notices 20(10): 95-104 (1985) - 1981
- [j1]Andrzej Szalas:
Algorithmic logic with recursive functions. Fundam. Informaticae 4(4): 975-996 (1981)
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-10-07 21:24 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:
