Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Andrzej Szalas
2010 – today
- 2013
[j39]- 2012
- [j38]Linh Anh Nguyen, Andrzej Szalas: Paraconsistent Reasoning for Semantic Web Agents. T. Computational Collective Intelligence 6: 36-55 (2012)
- [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
- 2011
- [j37]Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas: Converse-PDL with regular inclusion axioms: a framework for MAS logics. Journal of Applied Non-Classical Logics 21(1): 61-91 (2011)
- [j36]Jan Maluszynski, Andrzej Szalas: Logical foundations and complexity of 4QL, a query language with unrestricted negation. Journal of Applied Non-Classical Logics 21(2): 211-232 (2011)
- [j35]Linh Anh Nguyen, Andrzej Szalas: ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse. Studia 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]
- 2010
- [j34]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)
- [j33]Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas: A Framework for Graded Beliefs, Goals and Intentions. Fundam. Inform. 100(1-4): 53-76 (2010)
- [j32]Linh Anh Nguyen, Andrzej Szalas: Checking Consistency of an ABox w.r.t. Global Assumptions in PDL. Fundam. Inform. 102(1): 97-113 (2010)
- [j31]Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas: Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic. Int. J. Approx. Reasoning 51(3): 346-362 (2010)
- [j30]Linh Anh Nguyen, Andrzej Szalas: Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH. T. Computational Collective Intelligence 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
- [j29]Aida Vitória, Jan Maluszynski, Andrzej Szalas: Modeling and Reasoning with Paraconsistent Rough Sets. Fundam. Inform. 97(4): 405-438 (2009)
- [j28]Dov M. Gabbay, Andrzej Szalas: Voting by Eliminating Quantifiers. Studia Logica 92(3): 365-379 (2009)
- [j27]Dov M. Gabbay, Andrzej Szalas: Annotation Theories over Finite Graphs. Studia 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
- [j26]Andrzej Szalas: Towards incorporating background theories into quantifier elimination. Journal of Applied Non-Classical 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
- [j25]Patrick Doherty, Andrzej Szalas: A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning. Fundam. Inform. 75(1-4): 179-193 (2007)
- [j24]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Communication between agents with heterogeneous perceptual capabilities. Information Fusion 8(1): 56-69 (2007)
- [j23]Dov M. Gabbay, Andrzej Szalas: Second-Order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals. Studia Logica 87(1): 37-50 (2007)
- [j22]Jan Maluszynski, Andrzej Szalas, Aida Vitória: A Four-Valued Logic for Rough Set-Like Approximate Reasoning. T. Rough Sets 6: 176-190 (2007)
- [c20]
- [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
- [j21]Patrick Doherty, Martin Magnusson, Andrzej Szalas: Approximate databases: a support tool for approximate reasoning. Journal of Applied Non-Classical Logics 16(1-2): 87-118 (2006)
- [j20]Andrzej Szalas: Second-order reasoning in description logics. Journal of Applied Non-Classical 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
- 2003
- [j19]Patrick Doherty, Michal Grabowski, Witold Lukaszewicz, Andrzej Szalas: Towards a Framework for Approximate Ontologies. Fundam. Inform. 57(2-4): 147-165 (2003)
- [j18]Patrick Doherty, Andrzej Skowron, Witold Lukaszewicz, Andrzej Szalas: Preface. Fundam. Inform. 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]
- 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
- [j17]Patrick Doherty, J. Kachniarz, Andrzej Szalas: Meta-Queries on Deductive Databases. Fundam. Inform. 40(1): 7-30 (1999)
- [j16]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Declarative PTIME Queries for Relational Databases using Quantifier Elimination. J. Log. Comput. 9(5): 737-758 (1999)
- 1998
- [j15]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: General Domain Circumscription and its Effective Reductions. Fundam. Inform. 36(1): 23-55 (1998)
- [e2]Ewa Orlowska, Andrzej Szalas (Eds.): Participants Copies for Relational Methods in Logic, Algebra and Computer Science, 4th International Seminar RelMiCS, Warsaw, Poland, Septermber 14-20, 1998. 1998
- 1997
- [j14]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Computing Circumscription Revisited: A Reduction Algorithm. J. Autom. Reasoning 18(3): 297-336 (1997)
- 1996
- [j13]Andrzej Szalas: On Natural Deduction in First-Ortder Fixpoint Logics. Fundam. Inform. 26(1): 81-94 (1996)
- [j12]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: A Reduction Result for Circumscribed Semi-Horn Formulas. Fundam. Inform. 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 (Eds.): 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
- 1995
- [c1]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Computing Circumscription Revisited: Preliminary Report. IJCAI 1995: 1502-1508
- 1994
- [j11]Andrzej Szalas: On an Automated Translation of Modal Proof Rules into Formulas of the Classical Logic. Journal of Applied Non-Classical Logics 4(2): 119-127 (1994)
- 1993
- [j10]Andrzej Szalas: On the Correspondence between Modal and Classical Logic: An Automated Approach. J. Log. Comput. 3(6): 605-620 (1993)
- 1992
- [j9]
- 1991
- [j8]Andrzej Szalas: On Strictly Arithmetical Completeness in Logics of Programs. Theor. Comput. Sci. 79(2): 341-355 (1991)
1980 – 1989
- 1988
- [j7]Leszek Holenderski, Andrzej Szalas: Propositional Description of Finite Cause-Effect Structures. Inf. Process. Lett. 27(3): 111-117 (1988)
- [j6]Andrzej Szalas: An Incompleteness Result in Process Algebra. Inf. Process. Lett. 29(2): 67-70 (1988)
- [j5]Andrzej Szalas, Leszek Holenderski: Incompleteness of First-Order Temporal Logic with Until. Theor. Comput. Sci. 57: 317-325 (1988)
- 1987
- [j4]Andrzej Szalas: Arithmetical Axiomatization of First-Order Temporal Logic. Inf. Process. Lett. 26(3): 111-116 (1987)
- [j3]Andrzej Szalas: A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time. Theor. Comput. Sci. 54: 199-214 (1987)
- 1986
- [j2]Andrzej Szalas: Concerning the Semantic Consequence Relation in First-Order Temporal Logic. Theor. Comput. Sci. 47(3): 329-334 (1986)
- 1981
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18 22:42 CEST by the dblp team