The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrzej Szalas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrzej Szalas, Jerzy Tyszkiewicz
    On the Fixpoint Theory of Equality and Its Applications. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2006, pp:388-401 [Conf]
  2. Ewa Orlowska, Andrzej Szalas
    Quantifier Elimination in Elementary Set Theory. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2005, pp:237-248 [Conf]
  3. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Efficient Reasoning Using the Local Closed-World Assumption. [Citation Graph (0, 0)][DBLP]
    AIMSA, 2000, pp:49-58 [Conf]
  4. Michal Grabowski, Andrzej Szalas
    A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies. [Citation Graph (0, 0)][DBLP]
    AWIC, 2005, pp:183-189 [Conf]
  5. Patrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szalas
    Towards a Logical Analysis of Biochemical Reactions. [Citation Graph (0, 0)][DBLP]
    ECAI, 2004, pp:997-998 [Conf]
  6. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    CAKE: A Computer-Aided Knowledge Engineering Technique. [Citation Graph (0, 0)][DBLP]
    ECAI, 2002, pp:220-224 [Conf]
  7. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    General Domain Circumscription in its First-Order Reduction. [Citation Graph (0, 0)][DBLP]
    FAPR, 1996, pp:93-109 [Conf]
  8. Andrzej Szalas
    On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:423-431 [Conf]
  9. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:145-154 [Conf]
  10. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Computing Circumscription Revisited: Preliminary Report. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:1502-1508 [Conf]
  11. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Explaining Explanation Closure. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1996, pp:521-530 [Conf]
  12. Patrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szalas
    Towards a Logical Analysis of Biochemical Pathways. [Citation Graph (0, 0)][DBLP]
    JELIA, 2004, pp:667-679 [Conf]
  13. Andrzej Szalas
    Second-Order Quantifier Elimination in Modal Contexts. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:223-232 [Conf]
  14. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Tolerance Spaces and Approximative Representational Structures. [Citation Graph (0, 0)][DBLP]
    KI, 2003, pp:475-489 [Conf]
  15. Patrick Doherty, Andrzej Szalas, Witold Lukaszewicz
    Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities. [Citation Graph (0, 0)][DBLP]
    KR, 2004, pp:459-468 [Conf]
  16. Patrick Doherty, Andrzej Szalas
    On the Correspondence between Approximations and Similarity. [Citation Graph (0, 0)][DBLP]
    Rough Sets and Current Trends in Computing, 2004, pp:143-152 [Conf]
  17. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Information Granules for Intelligent Knowledge Structures. [Citation Graph (0, 0)][DBLP]
    RSFDGrC, 2003, pp:405-412 [Conf]
  18. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Similarity, Approximations and Vagueness. [Citation Graph (0, 0)][DBLP]
    RSFDGrC (1), 2005, pp:541-550 [Conf]
  19. Patrick Doherty, Michal Grabowski, Witold Lukaszewicz, Andrzej Szalas
    Towards a Framework for Approximate Ontologies. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:57, n:2-4, pp:147-165 [Journal]
  20. Patrick Doherty, J. Kachniarz, Andrzej Szalas
    Meta-Queries on Deductive Databases. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:40, n:1, pp:7-30 [Journal]
  21. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    A Reduction Result for Circumscribed Semi-Horn Formulas. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:28, n:3-4, pp:261-271 [Journal]
  22. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    General Domain Circumscription and its Effective Reductions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1998, v:36, n:1, pp:23-55 [Journal]
  23. Patrick Doherty, Andrzej Skowron, Witold Lukaszewicz, Andrzej Szalas
    Preface. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:57, n:2-4, pp:- [Journal]
  24. Andrzej Szalas
    Algorithmic logic with recursive functions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:4, pp:975-996 [Journal]
  25. Andrzej Szalas
    On Natural Deduction in First-Ortder Fixpoint Logics. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:26, n:1, pp:81-94 [Journal]
  26. Patrick Doherty, Andrzej Szalas
    A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:75, n:1-4, pp:179-193 [Journal]
  27. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Communication between agents with heterogeneous perceptual capabilities. [Citation Graph (0, 0)][DBLP]
    Information Fusion, 2007, v:8, n:1, pp:56-69 [Journal]
  28. Leszek Holenderski, Andrzej Szalas
    Propositional Description of Finite Cause-Effect Structures. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:3, pp:111-117 [Journal]
  29. Andrzej Szalas
    Arithmetical Axiomatization of First-Order Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:3, pp:111-116 [Journal]
  30. Andrzej Szalas
    An Incompleteness Result in Process Algebra. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:2, pp:67-70 [Journal]
  31. Andrzej Szalas
    Axiomatizing Fixpoint Logics. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:4, pp:175-180 [Journal]
  32. Patrick Doherty, Martin Magnusson, Andrzej Szalas
    Approximate databases: a support tool for approximate reasoning. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2006, v:16, n:1-2, pp:87-118 [Journal]
  33. Andrzej Szalas
    On an Automated Translation of Modal Proof Rules into Formulas of the Classical Logic. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 1994, v:4, n:2, pp:- [Journal]
  34. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Computing Circumscription Revisited: A Reduction Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1997, v:18, n:3, pp:297-336 [Journal]
  35. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Declarative PTIME Queries for Relational Databases using Quantifier Elimination. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1999, v:9, n:5, pp:737-758 [Journal]
  36. Andrzej Szalas
    On the Correspondence between Modal and Classical Logic: An Automated Approach. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1993, v:3, n:6, pp:605-620 [Journal]
  37. Andrzej Szalas
    Concerning the Semantic Consequence Relation in First-Order Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:329-334 [Journal]
  38. Andrzej Szalas
    A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:54, n:, pp:199-214 [Journal]
  39. Andrzej Szalas
    On Strictly Arithmetical Completeness in Logics of Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:79, n:2, pp:341-355 [Journal]
  40. Andrzej Szalas, Leszek Holenderski
    Incompleteness of First-Order Temporal Logic with Until. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:57, n:, pp:317-325 [Journal]
  41. Barbara Dunin-Keplicz, Andrzej Szalas
    Towards Approximate BGI Systems. [Citation Graph (0, 0)][DBLP]
    CEEMAS, 2007, pp:277-287 [Conf]
  42. Patrick Doherty, Barbara Dunin-Keplicz, Andrzej Szalas
    Dynamics of Approximate Information Fusion. [Citation Graph (0, 0)][DBLP]
    RSEISP, 2007, pp:668-677 [Conf]
  43. Jan Maluszynski, Andrzej Szalas, Aida Vitória
    A Four-Valued Logic for Rough Set-Like Approximate Reasoning. [Citation Graph (0, 0)][DBLP]
    T. Rough Sets, 2007, v:6, n:, pp:176-190 [Journal]

  44. Paraconsistent Reasoning with Words. [Citation Graph (, )][DBLP]


  45. A Tableau Calculus for Regular Grammar Logics with Converse. [Citation Graph (, )][DBLP]


  46. Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription. [Citation Graph (, )][DBLP]


  47. Paraconsistent Logic Programs with Four-Valued Rough Sets. [Citation Graph (, )][DBLP]


  48. On the Correctness of Rough-Set Based Approximate Reasoning. [Citation Graph (, )][DBLP]


  49. Four-Valued Extension of Rough Sets. [Citation Graph (, )][DBLP]


  50. Three-Valued Paraconsistent Reasoning for Semantic Web Agents. [Citation Graph (, )][DBLP]


  51. Fusing Approximate Knowledge from Distributed Sources. [Citation Graph (, )][DBLP]


  52. ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC\mathcal{ALC}. [Citation Graph (, )][DBLP]


  53. Optimal Tableau Decision Procedures for PDL [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002