Andrzej Szalas

137 papers A* 5A 4B 13C 2Misc 5Journal 63Unranked 38
YearRankTypeTitle / Venue / Authors
2025 J jnl
Bridge and Bound: A Logic-Based Framework for Abstracting (Preliminary Report).
CoRR
Andrzej Szalas
2024 J jnl
Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions.
Artif. Intell.
Patrick Doherty, Andrzej Szalas
2024 J jnl
Logics from rough sets.
J. Appl. Non Class. Logics
Mohua Banerjee, Mihir K. Chakraborty, Andrzej Szalas
2024 J jnl
Modeling and shadowing paraconsistent BDI agents.
Ann. Math. Artif. Intell.
Barbara Dunin-Keplicz, Andrzej Szalas
2024 J jnl
Techniques for Measuring the Inferential Strength of Forgetting Policies.
CoRR
Patrick Doherty, Andrzej Szalas
2023 J jnl
Dual Forgetting Operators in the Context of Weakest Sufficient and Strongest Necessary Conditions.
CoRR
Patrick Doherty, Andrzej Szalas
2022 J jnl
A landscape and implementation framework for probabilistic rough sets using ProbLog.
Inf. Sci.
Patrick Doherty, Andrzej Szalas
2022 B conf
Inheriting and Fusing Beliefs of Logically Heterogeneous Objects.
KES
Andrzej Szalas
2022 B conf
Querying and Reasoning in Paraconsistent Rule-Object Languages with Inheritance Expressions.
ICCCI
Andrzej Szalas
2021 — conf
Many-Valued Dynamic Object-Oriented Inheritance and Approximations.
IJCRS
Andrzej Szalas
2021 B conf
Optimization Models for Medical Procedures Relocation.
KES
Linh Anh Nguyen, Andrzej Szalas
2021 J jnl
Rough set reasoning using answer set programs.
Int. J. Approx. Reason.
Patrick Doherty, Andrzej Szalas
2020 B conf
A Framework for Organization-Centered Doxastic Reasoning.
KES
Barbara Dunin-Keplicz, Andrzej Szalas
2020 J jnl
A Paraconsistent ASP-Like Language with Tractable Model Generation.
FLAP
Andrzej Szalas
2020 J jnl
On the Probability and Cost of Ignorance, Inconsistency, Nonsense and More.
J. Multiple Valued Log. Soft Comput.
Andrzej Szalas
2020 B conf
Revisiting Object-Rule Fusion in Query Languages.
KES
Andrzej Szalas
2020 — conf
Rough Forgetting.
IJCRS
Patrick Doherty, Andrzej Szalas
2020 — conf
Shadowing in Many-Valued Nested Structures.
ISMVL
Barbara Dunin-Keplicz, Andrzej Szalas
2019 J jnl
A Paraconsistent ASP-like Language with Tractable Model Generation.
CoRR
Andrzej Szalas
2019 J jnl
A paraconsistent approach to actions in informationally complex environments.
Ann. Math. Artif. Intell.
Lukasz Bialek, Barbara Dunin-Keplicz, Andrzej Szalas
2019 — conf
Decision-Making Support Using Nonmonotonic Probabilistic Reasoning.
KES-IDT (1)
Andrzej Szalas
2019 B conf
Doxastic Group Reasoning via Multiple Belief Shadowing.
PRIMA
Barbara Dunin-Keplicz, Inga Rüb, Andrzej Szalas
2019 J jnl
Paraconsistent Reasoning in Cops and Robber Game with Uncertain Information: A Simulation-Based Analysis.
Int. J. Uncertain. Fuzziness Knowl. Based Syst.
Jacek Szklarski, Lukasz Bialek, Andrzej Szalas
2018 — conf
Belief Shadowing.
EMAS@AAMAS
Lukasz Bialek, Barbara Dunin-Keplicz, Andrzej Szalas
2018 J jnl
Paraconsistent Rule-based Reasoning with Graded Truth Values.
FLAP
Francesco Luca De Angelis, Giovanna Di Marzo Serugendo, Andrzej Szalas
2017 — conf
Heterogeneous Approximate Reasoning with Graded Truth Values.
IJCRS (1)
Francesco Luca De Angelis, Giovanna Di Marzo Serugendo, Barbara Dunin-Keplicz, Andrzej Szalas
2017 C conf
Rule-Based Reasoning with Belief Structures.
ISMIS
Lukasz Bialek, Barbara Dunin-Keplicz, Andrzej Szalas
2017 Misc conf
Towards a Paraconsistent Approach to Actions in Distributed Information-Rich Environments.
IDC
Lukasz Bialek, Barbara Dunin-Keplicz, Andrzej Szalas
2016 — conf
An Entailment Procedure for Kleene Answer Set Programs.
MIWAI
Patrick Doherty, Andrzej Szalas
2016 B conf
Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs - (Extended Abstract).
JELIA
Patrick Doherty, Jonas Kvarnström, Andrzej Szalas
2015 J jnl
Paraconsistent semantics of speech acts.
Neurocomputing
Barbara Dunin-Keplicz, Alina Strachocka, Andrzej Szalas, Rineke Verbrugge
2015 — conf
Stability, Supportedness, Minimality and Kleene Answer Set Programs.
Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation
Patrick Doherty, Andrzej Szalas
2015 J jnl
Towards richer rule languages with polynomial data complexity for the Semantic Web.
Data Knowl. Eng.
Linh Anh Nguyen, Thi-Bich-Loc Nguyen, Andrzej Szalas
2014 — conf
Indeterministic Belief Structures.
KES-AMSTA
Barbara Dunin-Keplicz, Andrzej Szalas
2014 — conf
Lightweight Reasoning with Incomplete and Inconsistent Information: A Case Study.
WI-IAT (3)
Lukasz Bialek, Andrzej Szalas
2014 — conf
Symbolic Explanations of Generalized Fuzzy Reasoning.
IDT/IIMSS/STET
Andrzej Szalas
2014 J jnl
The Web Ontology Rule Language OWL 2 RL + and Its Extensions.
Trans. Comput. Collect. Intell.
Son Thanh Cao, Linh Anh Nguyen, Andrzej Szalas
2014 — conf
Tractable Reasoning about Group Beliefs.
EMAS@AAMAS
Barbara Dunin-Keplicz, Andrzej Szalas, Rineke Verbrugge
2014 J jnl
WORL: a nonmonotonic rule language for the semantic web.
Vietnam. J. Comput. Sci.
Son Thanh Cao, Linh Anh Nguyen, Andrzej Szalas
2013 J jnl
Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination.
Fundam. Informaticae
Patrick Doherty, Andrzej Szalas
2013 B conf
Horn-TeamLog: A Horn Fragment of TeamLog with PTime Data Complexity.
ICCCI
Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas
2013 — conf
HornDL: An Expressive Horn Description Logic with PTime Data Complexity.
RR
Linh Anh Nguyen, Thi-Bich-Loc Nguyen, Andrzej Szalas
2013 J jnl
How an agent might think.
Log. J. IGPL
Andrzej Szalas
2013 — ch.
Logic-Based Roughification.
Rough Sets and Intelligent Systems (1)
Linh Anh Nguyen, Andrzej Szalas
2013 — conf
On Horn Knowledge Bases in Regular Description Logic with Inverse.
KSE (1)
Linh Anh Nguyen, Thi-Bich-Loc Nguyen, Andrzej Szalas
2013 — conf
On the Horn Fragments of Serial Regular Grammar Logics with Converse.
KES-AMSTA
Linh Anh Nguyen, Andrzej Szalas
2013 — conf
Partiality and Inconsistency in Agents' Belief Bases.
KES-AMSTA
Jan Maluszynski, Andrzej Szalas
2013 — conf
Perceiving Speech Acts under Incomplete and Inconsistent Information.
KES-AMSTA
Barbara Dunin-Keplicz, Alina Strachocka, Andrzej Szalas, Rineke Verbrugge
2013 J jnl
Taming Complex Beliefs.
Trans. Comput. Collect. Intell.
Barbara Dunin-Keplicz, Andrzej Szalas
2012 — conf
A bisimulation-based method of concept learning for knowledge bases in description logics.
SoICT
Quang-Thuy Ha, Thi-Lan-Giao Hoang, Linh Anh Nguyen, Hung Son Nguyen, Andrzej Szalas, Thanh-Luong Tran
2012 — ch.
Agents in Approximate Environments.
Games, Actions and Social Software
Barbara Dunin-Keplicz, Andrzej Szalas
2012 — conf
Concept Learning for Description Logic-Based Information Systems.
KSE
Thanh-Luong Tran, Quang-Thuy Ha, Thi-Lan-Giao Hoang, Linh Anh Nguyen, Hung Son Nguyen, Andrzej Szalas
2012 Misc conf
Distributed Paraconsistent Belief Fusion.
IDC
Barbara Dunin-Keplicz, Andrzej Szalas
2012 — conf
Epistemic Profiles and Belief Structures.
KES-AMSTA
Barbara Dunin-Keplicz, Andrzej Szalas
2012 J jnl
Paraconsistent Reasoning for Semantic Web Agents.
Trans. Comput. Collect. Intell.
Linh Anh Nguyen, Andrzej Szalas
2012 A* conf
Temporal Composite Actions with Constraints.
KR
Patrick Doherty, Jonas Kvarnström, Andrzej Szalas
2011 — conf
Contextual Coalitional Games.
ICLA
Patrick Doherty, Tomasz P. Michalak, Jacek Sroka, Andrzej Szalas
2011 J jnl
Converse-PDL with regular inclusion axioms: a framework for MAS logics.
J. Appl. Non Class. Logics
Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas
2011 J jnl
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse.
Stud Logica
Linh Anh Nguyen, Andrzej Szalas
2011 J jnl
Logical foundations and complexity of 4QL, a query language with unrestricted negation.
J. Appl. Non Class. Logics
Jan Maluszynski, Andrzej Szalas
2011 — conf
On the Web Ontology Rule Language OWL 2 RL.
ICCCI (1)
Son Thanh Cao, Linh Anh Nguyen, Andrzej Szalas
2011 A conf
Tractable model checking for fragments of higher-order coalition logic.
AAMAS
Patrick Doherty, Barbara Dunin-Keplicz, Andrzej Szalas
2011 — conf
WORL: A Web Ontology Rule Language.
KSE
Son Thanh Cao, Linh Anh Nguyen, Andrzej Szalas
2010 J jnl
A Framework for Graded Beliefs, Goals and Intentions.
Fundam. Informaticae
Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas
2010 J jnl
A layered rule-based architecture for approximate knowledge fusion?
Comput. Sci. Inf. Syst.
Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas
2010 J jnl
Checking Consistency of an ABox w.r.t. Global Assumptions in PDL.
Fundam. Informaticae
Linh Anh Nguyen, Andrzej Szalas
2010 — conf
Living with Inconsistency and Taming Nonmonotonicity.
Datalog
Jan Maluszynski, Andrzej Szalas
2010 J jnl
Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation
CoRR
Jan Maluszynski, Andrzej Szalas
2010 — conf
On the Correctness of Rough-Set Based Approximate Reasoning.
RSCTC
Patrick Doherty, Andrzej Szalas
2010 J jnl
Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic
Trans. Comput. Collect. Intell.
Linh Anh Nguyen, Andrzej Szalas
2010 — conf
Three-Valued Paraconsistent Reasoning for Semantic Web Agents.
KES-AMSTA (1)
Linh Anh Nguyen, Andrzej Szalas
2010 J jnl
Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic.
Int. J. Approx. Reason.
Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas
2009 A conf
A Tableau Calculus for Regular Grammar Logics with Converse.
CADE
Linh Anh Nguyen, Andrzej Szalas
2009 J jnl
Annotation Theories over Finite Graphs.
Stud Logica
Dov M. Gabbay, Andrzej Szalas
2009 B conf
ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic
ICCCI
Linh Anh Nguyen, Andrzej Szalas
2009 Misc conf
Fusing Approximate Knowledge from Distributed Sources.
IDC
Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas
2009 J jnl
Modeling and Reasoning with Paraconsistent Rough Sets.
Fundam. Informaticae
Aida Vitória, Jan Maluszynski, Andrzej Szalas
2009 J jnl
Optimal Tableau Decision Procedures for PDL
CoRR
Linh Anh Nguyen, Andrzej Szalas
2009 — conf
Paraconsistent Reasoning with Words.
Aspects of Natural Language Processing
Alicja S. Szalas, Andrzej Szalas
2009 J jnl
Voting by Eliminating Quantifiers.
Stud Logica
Dov M. Gabbay, Andrzej Szalas
2008 — conf
Four-Valued Extension of Rough Sets.
RSKT
Aida Vitória, Andrzej Szalas, Jan Maluszynski
2008 — conf
Paraconsistent Logic Programs with Four-Valued Rough Sets.
RSCTC
Jan Maluszynski, Andrzej Szalas, Aida Vitória
2008 A* conf
Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription.
KR
Patrick Doherty, Andrzej Szalas
2008 — book
Second-Order Quantifier Elimination - Foundations, Computational Aspects and Applications.
Dov M. Gabbay, Renate A. Schmidt, Andrzej Szalas
2008 J jnl
Towards incorporating background theories into quantifier elimination.
J. Appl. Non Class. Logics
Andrzej Szalas
2007 J jnl
A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning.
Fundam. Informaticae
Patrick Doherty, Andrzej Szalas
2007 J jnl
A Four-Valued Logic for Rough Set-Like Approximate Reasoning.
Trans. Rough Sets
Jan Maluszynski, Andrzej Szalas, Aida Vitória
2007 J jnl
Communication between agents with heterogeneous perceptual capabilities.
Inf. Fusion
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
2007 — conf
Dynamics of Approximate Information Fusion.
RSEISP
Patrick Doherty, Barbara Dunin-Keplicz, Andrzej Szalas
2007 J jnl
Second-Order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals.
Stud Logica
Dov M. Gabbay, Andrzej Szalas
2007 — conf
Towards Approximate BGI Systems.
CEEMAS
Barbara Dunin-Keplicz, Andrzej Szalas
2006 J jnl
Approximate databases: a support tool for approximate reasoning.
J. Appl. Non Class. Logics
Patrick Doherty, Martin Magnusson, Andrzej Szalas
2006 — book
Knowledge Representation Techniques - A Rough Set Approach
Patrick Doherty, Witold Lukaszewicz, Andrzej Skowron, Andrzej Szalas
2006 — conf
On the Fixpoint Theory of Equality and Its Applications.
RelMiCS
Andrzej Szalas, Jerzy Tyszkiewicz
2006 J jnl
Second-order reasoning in description logics.
J. Appl. Non Class. Logics
Andrzej Szalas
2005 — conf
A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies.
AWIC
Michal Grabowski, Andrzej Szalas
2005 — conf
Quantifier Elimination in Elementary Set Theory.
RelMiCS
Ewa Orlowska, Andrzej Szalas
2005 — conf
Similarity, Approximations and Vagueness.
RSFDGrC (1)
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
2004 — ch.
Approximation Transducers and Trees: A Technique for Combining Rough and Crisp Knowledge.
Rough-Neural Computing: Techniques for Computing with Words
Patrick Doherty, Witold Lukaszewicz, Andrzej Skowron, Andrzej Szalas
2004 A* conf
Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities.
KR
Patrick Doherty, Andrzej Szalas, Witold Lukaszewicz
2004 — conf
On the Correspondence between Approximations and Similarity.
Rough Sets and Current Trends in Computing
Patrick Doherty, Andrzej Szalas
2004 B conf
Towards a Logical Analysis of Biochemical Pathways.
JELIA
Patrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szalas
2004 A conf
Towards a Logical Analysis of Biochemical Reactions.
ECAI
Patrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szalas
2004 — ch.
Using Contextually Closed Queries for Local Closed-World Reasoning in Rough Knowledge Databases.
Rough-Neural Computing: Techniques for Computing with Words
Patrick Doherty, Jaroslaw Kachniarz, Andrzej Szalas
2003 — conf
Information Granules for Intelligent Knowledge Structures.
RSFDGrC
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
2003 B conf
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems.
FCT
Andrzej Szalas
2003 J jnl
Preface.
Fundam. Informaticae
Patrick Doherty, Andrzej Skowron, Witold Lukaszewicz, Andrzej Szalas
2003 Misc conf
Tolerance Spaces and Approximative Representational Structures.
KI
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
2003 J jnl
Towards a Framework for Approximate Ontologies.
Fundam. Informaticae
Patrick Doherty, Michal Grabowski, Witold Lukaszewicz, Andrzej Szalas
2002 A conf
CAKE: A Computer-Aided Knowledge Engineering Technique.
ECAI
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
2002 B conf
Second-Order Quantifier Elimination in Modal Contexts.
JELIA
Andrzej Szalas
2001 A* conf
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas.
IJCAI
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
2000 Misc conf
Efficient Reasoning Using the Local Closed-World Assumption.
AIMSA
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
1999 J jnl
Declarative PTIME Queries for Relational Databases using Quantifier Elimination.
J. Log. Comput.
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
1999 J jnl
Meta-Queries on Deductive Databases.
Fundam. Informaticae
Patrick Doherty, Jaroslaw Kachniarz, Andrzej Szalas
1998 J jnl
General Domain Circumscription and its Effective Reductions.
Fundam. Informaticae
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
1998 — ed.
Participants Copies for Relational Methods in Logic, Algebra and Computer Science, 4th International Seminar RelMiCS, Warsaw, Poland, September 14-20, 1998
RelMiCS
Ewa Orlowska, Andrzej Szalas
1997 J jnl
Computing Circumscription Revisited: A Reduction Algorithm.
J. Autom. Reason.
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
1996 J jnl
A Reduction Result for Circumscribed Semi-Horn Formulas.
Fundam. Informaticae
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
1996 C conf
Explaining Explanation Closure.
ISMIS
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
1996 — conf
General Domain Circumscription in its First-Order Reduction.
FAPR
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
1996 B ed.
Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings
MFCS
Wojciech Penczek, Andrzej Szalas
1996 J jnl
On Natural Deduction in First-Ortder Fixpoint Logics.
Fundam. Informaticae
Andrzej Szalas
1995 A* conf
Computing Circumscription Revisited: Preliminary Report.
IJCAI
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
1994 J jnl
On an Automated Translation of Modal Proof Rules into Formulas of the Classical Logic.
J. Appl. Non Class. Logics
Andrzej Szalas
1993 J jnl
On the Correspondence between Modal and Classical Logic: An Automated Approach.
J. Log. Comput.
Andrzej Szalas
1992 J jnl
Axiomatizing Fixpoint Logics.
Inf. Process. Lett.
Andrzej Szalas
1991 J jnl
On Strictly Arithmetical Completeness in Logics of Programs.
Theor. Comput. Sci.
Andrzej Szalas
1988 J jnl
An Incompleteness Result in Process Algebra.
Inf. Process. Lett.
Andrzej Szalas
1988 J jnl
Incompleteness of First-Order Temporal Logic with Until.
Theor. Comput. Sci.
Andrzej Szalas, Leszek Holenderski
1988 J jnl
Propositional Description of Finite Cause-Effect Structures.
Inf. Process. Lett.
Leszek Holenderski, Andrzej Szalas
1987 J jnl
A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time.
Theor. Comput. Sci.
Andrzej Szalas
1987 J jnl
Arithmetical Axiomatization of First-Order Temporal Logic.
Inf. Process. Lett.
Andrzej Szalas
1986 J jnl
Concerning the Semantic Consequence Relation in First-Order Temporal Logic.
Theor. Comput. Sci.
Andrzej Szalas
1985 J jnl
A note on PCI: distributed processes communicating by interrupts.
ACM SIGPLAN Notices
Uwe Petermann, Andrzej Szalas
1985 J jnl
Exception handling in parallel computations.
ACM SIGPLAN Notices
Andrzej Szalas, Danuta Szczepanska
1981 J jnl
Algorithmic logic with recursive functions.
Fundam. Informaticae
Andrzej Szalas