Andrzej Szalas

Proceedings of the Agent and Multi-Agent Systems: Technologies and Applications, 2014

Symbolic Explanations of Generalized Fuzzy Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Smart Digital Futures 2014, 2014

Tractable Reasoning about Group Beliefs.

[BibT_eX]

[DOI]

Rineke Verbrugge

Proceedings of the Engineering Multi-Agent Systems - Second International Workshop, 2014

2013

Logic-Based Roughification.

[BibT_eX]

[DOI]

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

Taming Complex Beliefs.

[BibT_eX]

[DOI]

Trans. Comput. Collect. Intell., 2013

How an agent might think.

[BibT_eX]

[DOI]

Log. J. IGPL, 2013

Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

HornDL: An Expressive Horn Description Logic with PTime Data Complexity.

[BibT_eX]

[DOI]

Thi-Bich-Loc Nguyen

Proceedings of the Web Reasoning and Rule Systems - 7th International Conference, 2013

On Horn Knowledge Bases in Regular Description Logic with Inverse.

[BibT_eX]

[DOI]

Thi-Bich-Loc Nguyen

Proceedings of the Knowledge and Systems Engineering, 2013

On the Horn Fragments of Serial Regular Grammar Logics with Converse.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Alina Strachocka

Rineke Verbrugge

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.

[BibT_eX]

[DOI]

Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2013

2012

Agents in Approximate Environments.

[BibT_eX]

[DOI]

Proceedings of the Games, Actions and Social Software - Multidisciplinary Aspects, 2012

Paraconsistent Reasoning for Semantic Web Agents.

[BibT_eX]

[DOI]

Trans. Comput. Collect. Intell., 2012

A bisimulation-based method of concept learning for knowledge bases in description logics.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Information and Communication Technology 2012, 2012

Concept Learning for Description Logic-Based Information Systems.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Knowledge and Systems Engineering, 2012

Temporal Composite Actions with Constraints.

[BibT_eX]

[DOI]

Jonas Kvarnström

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Epistemic Profiles and Belief Structures.

[BibT_eX]

[DOI]

Proceedings of the Agent and Multi-Agent Systems. Technologies and Applications, 2012

Distributed Paraconsistent Belief Fusion.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Stud Logica, 2011

Logical foundations and complexity of 4QL, a query language with unrestricted negation.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2011

Converse-PDL with regular inclusion axioms: a framework for MAS logics.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2011

WORL: A Web Ontology Rule Language.

[BibT_eX]

[DOI]

Son Thanh Cao

Proceedings of the Third International Conference on Knowledge and Systems Engineering, 2011

Contextual Coalitional Games.

[BibT_eX]

[DOI]

Proceedings of the Logic and Its Applications - 4th Indian Conference, 2011

On the Web Ontology Rule Language OWL 2 RL.

[BibT_eX]

[DOI]

Son Thanh Cao

Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2011

Tractable model checking for fragments of higher-order coalition logic.

[BibT_eX]

[DOI]

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>.

[BibT_eX]

[DOI]

Trans. Comput. Collect. Intell., 2010

Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2010

Checking Consistency of an ABox w.r.t. Global Assumptions in PDL.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

A Framework for Graded Beliefs, Goals and Intentions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

A layered rule-based architecture for approximate knowledge fusion?

[BibT_eX]

[DOI]

Comput. Sci. Inf. Syst., 2010

On the Correctness of Rough-Set Based Approximate Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2010

Three-Valued Paraconsistent Reasoning for Semantic Web Agents.

[BibT_eX]

[DOI]

Proceedings of the Agent and Multi-Agent Systems: Technologies and Applications, 2010

Living with Inconsistency and Taming Nonmonotonicity.

[BibT_eX]

[DOI]

Proceedings of the Datalog Reloaded - First International Workshop, 2010

2009

Annotation Theories over Finite Graphs.

[BibT_eX]

[DOI]

Stud Logica, 2009

Voting by Eliminating Quantifiers.

[BibT_eX]

[DOI]

Stud Logica, 2009

Modeling and Reasoning with Paraconsistent Rough Sets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Optimal Tableau Decision Procedures for PDL

[BibT_eX]

[DOI]

CoRR, 2009

Fusing Approximate Knowledge from Distributed Sources.

[BibT_eX]

[DOI]

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}.

[BibT_eX]

[DOI]

Proceedings of the Computational Collective Intelligence. Semantic Web, 2009

A Tableau Calculus for Regular Grammar Logics with Converse.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2009

Paraconsistent Reasoning with Words.

[BibT_eX]

[DOI]

Alicja S. Szalas

Proceedings of the Aspects of Natural Language Processing, 2009

2008

Towards incorporating background theories into quantifier elimination.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2008

Four-Valued Extension of Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology, Third International Conference, 2008

Paraconsistent Logic Programs with Four-Valued Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2008

Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Renate A. Schmidt

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.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2007

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

[BibT_eX]

[DOI]

Stud Logica, 2007

Communication between agents with heterogeneous perceptual capabilities.

[BibT_eX]

[DOI]

Inf. Fusion, 2007

A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

Dynamics of Approximate Information Fusion.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Intelligent Systems Paradigms, International Conference, 2007

Towards Approximate BGI Systems.

[BibT_eX]

[DOI]

Proceedings of the Multi-Agent Systems and Applications V, 2007

2006

Second-order reasoning in description logics.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2006

Approximate databases: a support tool for approximate reasoning.

[BibT_eX]

[DOI]

Martin Magnusson

J. Appl. Non Class. Logics, 2006

On the Fixpoint Theory of Equality and Its Applications.

[BibT_eX]

[DOI]

Jerzy Tyszkiewicz

Proceedings of the Relations and Kleene Algebra in Computer Science, 2006

Knowledge Representation Techniques - A Rough Set Approach

[BibT_eX]

[DOI]

Studies in Fuzziness and Soft Computing 202, Springer, ISBN: 978-3-540-33518-4, 2006

2005

Similarity, Approximations and Vagueness.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, 2005

A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies.

[BibT_eX]

[DOI]

Michal Grabowski

Proceedings of the Advances in Web Intelligence Third International Atlantic Web IntelligenceConference, 2005

Quantifier Elimination in Elementary Set Theory.

[BibT_eX]

[DOI]

Ewa Orlowska

Proceedings of the Relational Methods in Computer Science, 2005

2004

Approximation Transducers and Trees: A Technique for Combining Rough and Crisp Knowledge.

[BibT_eX]

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.

[BibT_eX]

Jaroslaw Kachniarz

Proceedings of the Rough-Neural Computing: Techniques for Computing with Words., 2004

On the Correspondence between Approximations and Similarity.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2004

Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

Towards a Logical Analysis of Biochemical Pathways.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence, 9th European Conference, 2004

Towards a Logical Analysis of Biochemical Reactions.

[BibT_eX]

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

2003

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Towards a Framework for Approximate Ontologies.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Information Granules for Intelligent Knowledge Structures.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, 2003

Tolerance Spaces and Approximative Representational Structures.

[BibT_eX]

[DOI]

Proceedings of the KI 2003: Advances in Artificial Intelligence, 2003

On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

Second-Order Quantifier Elimination in Modal Contexts.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

CAKE: A Computer-Aided Knowledge Engineering Technique.

[BibT_eX]

Proceedings of the 15th European Conference on Artificial Intelligence, 2002

2001

Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas.

[BibT_eX]

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

2000

Efficient Reasoning Using the Local Closed-World Assumption.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence: Methodology, 2000

1999

Declarative PTIME Queries for Relational Databases using Quantifier Elimination.

[BibT_eX]

[DOI]

J. Log. Comput., 1999

Meta-Queries on Deductive Databases.

[BibT_eX]

[DOI]

Jaroslaw Kachniarz

Fundam. Informaticae, 1999

1998

General Domain Circumscription and its Effective Reductions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1998

1997

Computing Circumscription Revisited: A Reduction Algorithm.

[BibT_eX]

[DOI]

J. Autom. Reason., 1997

1996

On Natural Deduction in First-Ortder Fixpoint Logics.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

A Reduction Result for Circumscribed Semi-Horn Formulas.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

Explaining Explanation Closure.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Intelligent Systems, 9th International Symposium, 1996

General Domain Circumscription in its First-Order Reduction.

[BibT_eX]

[DOI]

Proceedings of the Practical Reasoning, 1996

1995

Computing Circumscription Revisited: Preliminary Report.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 1994

1993

On the Correspondence between Modal and Classical Logic: An Automated Approach.

[BibT_eX]

[DOI]

J. Log. Comput., 1993

1992

Axiomatizing Fixpoint Logics.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

1991

On Strictly Arithmetical Completeness in Logics of Programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

1988

Incompleteness of First-Order Temporal Logic with Until.

[BibT_eX]

[DOI]

Leszek Holenderski

Theor. Comput. Sci., 1988

An Incompleteness Result in Process Algebra.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

Propositional Description of Finite Cause-Effect Structures.

[BibT_eX]

[DOI]

Leszek Holenderski

Inf. Process. Lett., 1988

1987

A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Arithmetical Axiomatization of First-Order Temporal Logic.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

1986

Concerning the Semantic Consequence Relation in First-Order Temporal Logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

1985

Exception handling in parallel computations.

[BibT_eX]

[DOI]

Danuta Szczepanska

ACM SIGPLAN Notices, 1985

A note on PCI: distributed processes communicating by interrupts.

[BibT_eX]

[DOI]

Uwe Petermann

ACM SIGPLAN Notices, 1985

1981

Algorithmic logic with recursive functions.

[BibT_eX]