dblp.uni-trier.dewww.uni-trier.de

Andrzej Szalas Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
52EELinh Anh Nguyen, Andrzej Szalas: A Tableau Calculus for Regular Grammar Logics with Converse. CADE 2009: 421-436
51EELinh Anh Nguyen, Andrzej Szalas: ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC\mathcal{ALC}. ICCCI 2009: 437-448
50EELinh Anh Nguyen, Andrzej Szalas: Optimal Tableau Decision Procedures for PDL CoRR abs/0904.0721: (2009)
2008
49 Patrick Doherty, Andrzej Szalas: Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription. KR 2008: 560-570
48EEJan Maluszynski, Andrzej Szalas, Aida Vitória: Paraconsistent Logic Programs with Four-Valued Rough Sets. RSCTC 2008: 41-51
47EEAida Vitória, Andrzej Szalas, Jan Maluszynski: Four-Valued Extension of Rough Sets. RSKT 2008: 106-114
2007
46EEBarbara Dunin-Keplicz, Andrzej Szalas: Towards Approximate BGI Systems. CEEMAS 2007: 277-287
45EEPatrick Doherty, Barbara Dunin-Keplicz, Andrzej Szalas: Dynamics of Approximate Information Fusion. RSEISP 2007: 668-677
44EEPatrick Doherty, Andrzej Szalas: A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning. Fundam. Inform. 75(1-4): 179-193 (2007)
43EEPatrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Communication between agents with heterogeneous perceptual capabilities. Information Fusion 8(1): 56-69 (2007)
42EEDov 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)
41EEJan Maluszynski, Andrzej Szalas, Aida Vitória: A Four-Valued Logic for Rough Set-Like Approximate Reasoning. T. Rough Sets 6: 176-190 (2007)
2006
40EEAndrzej Szalas, Jerzy Tyszkiewicz: On the Fixpoint Theory of Equality and Its Applications. RelMiCS 2006: 388-401
39 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)
2005
38EEMichal Grabowski, Andrzej Szalas: A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies. AWIC 2005: 183-189
37EEPatrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Similarity, Approximations and Vagueness. RSFDGrC (1) 2005: 541-550
36EEEwa Orlowska, Andrzej Szalas: Quantifier Elimination in Elementary Set Theory. RelMiCS 2005: 237-248
2004
35 Patrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szalas: Towards a Logical Analysis of Biochemical Reactions. ECAI 2004: 997-998
34EEPatrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szalas: Towards a Logical Analysis of Biochemical Pathways. JELIA 2004: 667-679
33 Patrick Doherty, Andrzej Szalas, Witold Lukaszewicz: Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities. KR 2004: 459-468
32EEPatrick Doherty, Andrzej Szalas: On the Correspondence between Approximations and Similarity. Rough Sets and Current Trends in Computing 2004: 143-152
2003
31EEAndrzej Szalas: On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems. FCT 2003: 423-431
30EEPatrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Tolerance Spaces and Approximative Representational Structures. KI 2003: 475-489
29EEPatrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Information Granules for Intelligent Knowledge Structures. RSFDGrC 2003: 405-412
28EEPatrick Doherty, Andrzej Skowron, Witold Lukaszewicz, Andrzej Szalas: Preface. Fundam. Inform. 57(2-4): (2003)
27EEPatrick Doherty, Michal Grabowski, Witold Lukaszewicz, Andrzej Szalas: Towards a Framework for Approximate Ontologies. Fundam. Inform. 57(2-4): 147-165 (2003)
2002
26 Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: CAKE: A Computer-Aided Knowledge Engineering Technique. ECAI 2002: 220-224
25EEAndrzej Szalas: Second-Order Quantifier Elimination in Modal Contexts. JELIA 2002: 223-232
2001
24 Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas. IJCAI 2001: 145-154
2000
23EEPatrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Efficient Reasoning Using the Local Closed-World Assumption. AIMSA 2000: 49-58
1999
22 Patrick Doherty, J. Kachniarz, Andrzej Szalas: Meta-Queries on Deductive Databases. Fundam. Inform. 40(1): 7-30 (1999)
21EEPatrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Declarative PTIME Queries for Relational Databases using Quantifier Elimination. J. Log. Comput. 9(5): 737-758 (1999)
1998
20 Ewa Orlowska, Andrzej Szalas: Participants Copies for Relational Methods in Logic, Algebra and Computer Science, 4th International Seminar RelMiCS, Warsaw, Poland, Septermber 14-20, 1998 RelMiCS 1998
19 Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: General Domain Circumscription and its Effective Reductions. Fundam. Inform. 36(1): 23-55 (1998)
1997
18 Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Computing Circumscription Revisited: A Reduction Algorithm. J. Autom. Reasoning 18(3): 297-336 (1997)
1996
17 Wojciech Penczek, Andrzej Szalas: Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings Springer 1996
16 Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: General Domain Circumscription in its First-Order Reduction. FAPR 1996: 93-109
15EEPatrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Explaining Explanation Closure. ISMIS 1996: 521-530
14 Andrzej Szalas: On Natural Deduction in First-Ortder Fixpoint Logics. Fundam. Inform. 26(1): 81-94 (1996)
13 Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: A Reduction Result for Circumscribed Semi-Horn Formulas. Fundam. Inform. 28(3-4): 261-271 (1996)
1995
12 Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Computing Circumscription Revisited: Preliminary Report. IJCAI 1995: 1502-1508
1994
11 Andrzej Szalas: On an Automated Translation of Modal Proof Rules into Formulas of the Classical Logic. Journal of Applied Non-Classical Logics 4(2): (1994)
1993
10 Andrzej Szalas: On the Correspondence between Modal and Classical Logic: An Automated Approach. J. Log. Comput. 3(6): 605-620 (1993)
1992
9 Andrzej Szalas: Axiomatizing Fixpoint Logics. Inf. Process. Lett. 41(4): 175-180 (1992)
1991
8 Andrzej Szalas: On Strictly Arithmetical Completeness in Logics of Programs. Theor. Comput. Sci. 79(2): 341-355 (1991)
1988
7 Leszek Holenderski, Andrzej Szalas: Propositional Description of Finite Cause-Effect Structures. Inf. Process. Lett. 27(3): 111-117 (1988)
6 Andrzej Szalas: An Incompleteness Result in Process Algebra. Inf. Process. Lett. 29(2): 67-70 (1988)
5 Andrzej Szalas, Leszek Holenderski: Incompleteness of First-Order Temporal Logic with Until. Theor. Comput. Sci. 57: 317-325 (1988)
1987
4 Andrzej Szalas: Arithmetical Axiomatization of First-Order Temporal Logic. Inf. Process. Lett. 26(3): 111-116 (1987)
3 Andrzej Szalas: A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time. Theor. Comput. Sci. 54: 199-214 (1987)
1986
2 Andrzej Szalas: Concerning the Semantic Consequence Relation in First-Order Temporal Logic. Theor. Comput. Sci. 47(3): 329-334 (1986)
1981
1 Andrzej Szalas: Algorithmic logic with recursive functions. Fundam. Inform. 4(4): 975-996 (1981)

Coauthor Index

1Patrick Doherty [12] [13] [15] [16] [18] [19] [21] [22] [23] [24] [26] [27] [28] [29] [30] [32] [33] [34] [35] [37] [39] [43] [44] [45] [49]
2Barbara Dunin-Keplicz [45] [46]
3Dov M. Gabbay [42]
4Michal Grabowski [27] [38]
5Leszek Holenderski [5] [7]
6J. Kachniarz [22]
7Steve Kertes [34] [35]
8Witold Lukaszewicz [12] [13] [15] [16] [18] [19] [21] [23] [24] [26] [27] [28] [29] [30] [33] [37] [43]
9Martin Magnusson [34] [35] [39]
10Jan Maluszynski [41] [47] [48]
11Linh Anh Nguyen [50] [51] [52]
12Ewa Orlowska [20] [36]
13Wojciech Penczek [17]
14Andrzej Skowron [28]
15Jerzy Tyszkiewicz [40]
16Aida Vitória [41] [47] [48]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)