Andrzej Szalas

According to our database1, Andrzej Szalas authored at least 125 papers between 1981 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
A landscape and implementation framework for probabilistic rough sets using ProbLog.
Inf. Sci., 2022

2021
Rough set reasoning using answer set programs.
Int. J. Approx. Reason., 2021

Many-Valued Dynamic Object-Oriented Inheritance and Approximations.
Proceedings of the Rough Sets - International Joint Conference, 2021

Optimization Models for Medical Procedures Relocation.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 25th International Conference KES-2021, 2021

2020
On the Probability and Cost of Ignorance, Inconsistency, Nonsense and More.
J. Multiple Valued Log. Soft Comput., 2020

A Paraconsistent ASP-Like Language with Tractable Model Generation.
FLAP, 2020

Rough Forgetting.
Proceedings of the Rough Sets - International Joint Conference, 2020

Revisiting Object-Rule Fusion in Query Languages.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, 2020

A Framework for Organization-Centered Doxastic Reasoning.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, 2020

Shadowing in Many-Valued Nested Structures.
Proceedings of the 50th IEEE International Symposium on Multiple-Valued Logic, 2020

2019
Paraconsistent Reasoning in Cops and Robber Game with Uncertain Information: A Simulation-Based Analysis.
Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2019

A paraconsistent approach to actions in informationally complex environments.
Ann. Math. Artif. Intell., 2019

Doxastic Group Reasoning via Multiple Belief Shadowing.
Proceedings of the PRIMA 2019: Principles and Practice of Multi-Agent Systems, 2019

Decision-Making Support Using Nonmonotonic Probabilistic Reasoning.
Proceedings of the Intelligent Decision Technologies 2019, 2019

2018
Paraconsistent Rule-based Reasoning with Graded Truth Values.
FLAP, 2018

Belief Shadowing.
Proceedings of the Engineering Multi-Agent Systems - 6th International Workshop, 2018

2017
Heterogeneous Approximate Reasoning with Graded Truth Values.
Proceedings of the Rough Sets - International Joint Conference, 2017

Rule-Based Reasoning with Belief Structures.
Proceedings of the Foundations of Intelligent Systems - 23rd International Symposium, 2017

Towards a Paraconsistent Approach to Actions in Distributed Information-Rich Environments.
Proceedings of the Intelligent Distributed Computing XI - Proceedings of the 11th International Symposium on Intelligent Distributed Computing, 2017

2016
An Entailment Procedure for Kleene Answer Set Programs.
Proceedings of the Multi-disciplinary Trends in Artificial Intelligence, 2016

Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs - (Extended Abstract).
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

2015
Paraconsistent semantics of speech acts.
Neurocomputing, 2015

Towards richer rule languages with polynomial data complexity for the Semantic Web.
Data Knowl. Eng., 2015

Stability, Supportedness, Minimality and Kleene Answer Set Programs.
Proceedings of the Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015

2014
WORL: a nonmonotonic rule language for the semantic web.
Vietnam. J. Comput. Sci., 2014

The Web Ontology Rule Language OWL 2 RL + and Its Extensions.
Trans. Comput. Collect. Intell., 2014

Lightweight Reasoning with Incomplete and Inconsistent Information: A Case Study.
Proceedings of the 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT), Warsaw, Poland, August 11-14, 2014, 2014

Indeterministic Belief Structures.
Proceedings of the Agent and Multi-Agent Systems: Technologies and Applications, 2014

Symbolic Explanations of Generalized Fuzzy Reasoning.
Proceedings of the Smart Digital Futures 2014, 2014

Tractable Reasoning about Group Beliefs.
Proceedings of the Engineering Multi-Agent Systems - Second International Workshop, 2014

2013
Logic-Based Roughification.
Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

Taming Complex Beliefs.
Trans. Comput. Collect. Intell., 2013

How an agent might think.
Log. J. IGPL, 2013

Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination.
Fundam. Informaticae, 2013

HornDL: An Expressive Horn Description Logic with PTime Data Complexity.
Proceedings of the Web Reasoning and Rule Systems - 7th International Conference, 2013

On Horn Knowledge Bases in Regular Description Logic with Inverse.
Proceedings of the Knowledge and Systems Engineering, 2013

On the Horn Fragments of Serial Regular Grammar Logics with Converse.
Proceedings of the Advanced Methods and Technologies for Agent and Multi-Agent Systems, Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems, 2013

Partiality and Inconsistency in Agents' Belief Bases.
Proceedings of the Advanced Methods and Technologies for Agent and Multi-Agent Systems, Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems, 2013

Perceiving Speech Acts under Incomplete and Inconsistent Information.
Proceedings of the Advanced Methods and Technologies for Agent and Multi-Agent Systems, Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems, 2013

Horn-TeamLog: A Horn Fragment of TeamLog with PTime Data Complexity.
Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2013

2012
Agents in Approximate Environments.
Proceedings of the Games, Actions and Social Software - Multidisciplinary Aspects, 2012

Paraconsistent Reasoning for Semantic Web Agents.
Trans. Comput. Collect. Intell., 2012

A bisimulation-based method of concept learning for knowledge bases in description logics.
Proceedings of the Symposium on Information and Communication Technology 2012, 2012

Concept Learning for Description Logic-Based Information Systems.
Proceedings of the Fourth International Conference on Knowledge and Systems Engineering, 2012

Temporal Composite Actions with Constraints.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Epistemic Profiles and Belief Structures.
Proceedings of the Agent and Multi-Agent Systems. Technologies and Applications, 2012

Distributed Paraconsistent Belief Fusion.
Proceedings of the Intelligent Distributed Computing VI - Proceedings of the 6th International Symposium on Intelligent Distributed Computing, 2012

2011
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse.
Stud Logica, 2011

Logical foundations and complexity of 4QL, a query language with unrestricted negation.
J. Appl. Non Class. Logics, 2011

Converse-PDL with regular inclusion axioms: a framework for MAS logics.
J. Appl. Non Class. Logics, 2011

WORL: A Web Ontology Rule Language.
Proceedings of the Third International Conference on Knowledge and Systems Engineering, 2011

Contextual Coalitional Games.
Proceedings of the Logic and Its Applications - 4th Indian Conference, 2011

On the Web Ontology Rule Language OWL 2 RL.
Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2011

Tractable model checking for fragments of higher-order coalition logic.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010
Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic <i>SH</i>.
Trans. Comput. Collect. Intell., 2010

Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic.
Int. J. Approx. Reason., 2010

Checking Consistency of an ABox w.r.t. Global Assumptions in PDL.
Fundam. Informaticae, 2010

A Framework for Graded Beliefs, Goals and Intentions.
Fundam. Informaticae, 2010

A layered rule-based architecture for approximate knowledge fusion?
Comput. Sci. Inf. Syst., 2010

On the Correctness of Rough-Set Based Approximate Reasoning.
Proceedings of the Rough Sets and Current Trends in Computing, 2010

Three-Valued Paraconsistent Reasoning for Semantic Web Agents.
Proceedings of the Agent and Multi-Agent Systems: Technologies and Applications, 2010

Living with Inconsistency and Taming Nonmonotonicity.
Proceedings of the Datalog Reloaded - First International Workshop, 2010

2009
Annotation Theories over Finite Graphs.
Stud Logica, 2009

Voting by Eliminating Quantifiers.
Stud Logica, 2009

Modeling and Reasoning with Paraconsistent Rough Sets.
Fundam. Informaticae, 2009

Optimal Tableau Decision Procedures for PDL
CoRR, 2009

Fusing Approximate Knowledge from Distributed Sources.
Proceedings of the Intelligent Distributed Computing III, Proceedings of the 3rd International Symposium on Intelligent Distributed Computing, 2009

ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic <i>ALC</i>\mathcal{ALC}.
Proceedings of the Computational Collective Intelligence. Semantic Web, 2009

A Tableau Calculus for Regular Grammar Logics with Converse.
Proceedings of the Automated Deduction, 2009

Paraconsistent Reasoning with Words.
Proceedings of the Aspects of Natural Language Processing, 2009

2008
Towards incorporating background theories into quantifier elimination.
J. Appl. Non Class. Logics, 2008

Four-Valued Extension of Rough Sets.
Proceedings of the Rough Sets and Knowledge Technology, Third International Conference, 2008

Paraconsistent Logic Programs with Four-Valued Rough Sets.
Proceedings of the Rough Sets and Current Trends in Computing, 2008

Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Second-Order Quantifier Elimination - Foundations, Computational Aspects and Applications.
Studies in logic : Mathematical logic and foundations 12, College Publications, ISBN: 978-1-904987-56-7, 2008

2007
A Four-Valued Logic for Rough Set-Like Approximate Reasoning.
Trans. Rough Sets, 2007

Second-Order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals.
Stud Logica, 2007

Communication between agents with heterogeneous perceptual capabilities.
Inf. Fusion, 2007

A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning.
Fundam. Informaticae, 2007

Dynamics of Approximate Information Fusion.
Proceedings of the Rough Sets and Intelligent Systems Paradigms, International Conference, 2007

Towards Approximate BGI Systems.
Proceedings of the Multi-Agent Systems and Applications V, 2007

2006
Second-order reasoning in description logics.
J. Appl. Non Class. Logics, 2006

Approximate databases: a support tool for approximate reasoning.
J. Appl. Non Class. Logics, 2006

On the Fixpoint Theory of Equality and Its Applications.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2006

Knowledge Representation Techniques - A Rough Set Approach
Studies in Fuzziness and Soft Computing 202, Springer, ISBN: 978-3-540-33518-4, 2006

2005
Similarity, Approximations and Vagueness.
Proceedings of the Rough Sets, 2005

A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies.
Proceedings of the Advances in Web Intelligence Third International Atlantic Web IntelligenceConference, 2005

Quantifier Elimination in Elementary Set Theory.
Proceedings of the Relational Methods in Computer Science, 2005

2004
Approximation Transducers and Trees: A Technique for Combining Rough and Crisp Knowledge.
Proceedings of the Rough-Neural Computing: Techniques for Computing with Words., 2004

Using Contextually Closed Queries for Local Closed-World Reasoning in Rough Knowledge Databases.
Proceedings of the Rough-Neural Computing: Techniques for Computing with Words., 2004

On the Correspondence between Approximations and Similarity.
Proceedings of the Rough Sets and Current Trends in Computing, 2004

Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

Towards a Logical Analysis of Biochemical Pathways.
Proceedings of the Logics in Artificial Intelligence, 9th European Conference, 2004

Towards a Logical Analysis of Biochemical Reactions.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

2003
Preface.
Fundam. Informaticae, 2003

Towards a Framework for Approximate Ontologies.
Fundam. Informaticae, 2003

Information Granules for Intelligent Knowledge Structures.
Proceedings of the Rough Sets, 2003

Tolerance Spaces and Approximative Representational Structures.
Proceedings of the KI 2003: Advances in Artificial Intelligence, 2003

On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002
Second-Order Quantifier Elimination in Modal Contexts.
Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

CAKE: A Computer-Aided Knowledge Engineering Technique.
Proceedings of the 15th European Conference on Artificial Intelligence, 2002

2001
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

2000
Efficient Reasoning Using the Local Closed-World Assumption.
Proceedings of the Artificial Intelligence: Methodology, 2000

1999
Declarative PTIME Queries for Relational Databases using Quantifier Elimination.
J. Log. Comput., 1999

Meta-Queries on Deductive Databases.
Fundam. Informaticae, 1999

1998
General Domain Circumscription and its Effective Reductions.
Fundam. Informaticae, 1998

1997
Computing Circumscription Revisited: A Reduction Algorithm.
J. Autom. Reason., 1997

1996
On Natural Deduction in First-Ortder Fixpoint Logics.
Fundam. Informaticae, 1996

A Reduction Result for Circumscribed Semi-Horn Formulas.
Fundam. Informaticae, 1996

Explaining Explanation Closure.
Proceedings of the Foundations of Intelligent Systems, 9th International Symposium, 1996

General Domain Circumscription in its First-Order Reduction.
Proceedings of the Practical Reasoning, 1996

1995
Computing Circumscription Revisited: Preliminary Report.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994
On an Automated Translation of Modal Proof Rules into Formulas of the Classical Logic.
J. Appl. Non Class. Logics, 1994

1993
On the Correspondence between Modal and Classical Logic: An Automated Approach.
J. Log. Comput., 1993

1992
Axiomatizing Fixpoint Logics.
Inf. Process. Lett., 1992

1991
On Strictly Arithmetical Completeness in Logics of Programs.
Theor. Comput. Sci., 1991

1988
Incompleteness of First-Order Temporal Logic with Until.
Theor. Comput. Sci., 1988

An Incompleteness Result in Process Algebra.
Inf. Process. Lett., 1988

Propositional Description of Finite Cause-Effect Structures.
Inf. Process. Lett., 1988

1987
A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time.
Theor. Comput. Sci., 1987

Arithmetical Axiomatization of First-Order Temporal Logic.
Inf. Process. Lett., 1987

1986
Concerning the Semantic Consequence Relation in First-Order Temporal Logic.
Theor. Comput. Sci., 1986

1985
Exception handling in parallel computations.
ACM SIGPLAN Notices, 1985

A note on PCI: distributed processes communicating by interrupts.
ACM SIGPLAN Notices, 1985

1981
Algorithmic logic with recursive functions.
Fundam. Informaticae, 1981


  Loading...