| ||
1. | Paraconsistent Reasoning for Semantic Web Agents
LNCS TRANSACTIONS ON COMPUTATIONAL COLLECTIVE INTELLIGENCE Tom 7190 r. 2012, str. 36-55 (Artyku³) Andrzej Sza³as, Anh Linh Nguyen | |
2. | Contextual Coalitional Games
LECTURE NOTES IN COMPUTER SCIENCE Tom 6521 r. 2011, str. 65-78 (Artyku³ konferencyjny) Patrick Doherty, Jacek Sroka, Andrzej Sza³as, Tomasz Michalak | |
3. | Converse-PDL with Regular Inclusion Axioms: A Framework for MAS Logics
JOURNAL OF APPLIED NON-CLASSICAL LOGICS Tom 21 Nr 1 r. 2011, str. 61-81 (Artyku³) Barbara Dunin-Kêplicz, Anh Linh Nguyen, Andrzej Sza³as | |
4. | ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse
STUDIA LOGICA. AN INTERNATIONAL JOURNAL FOR SYMBOLIC LOGIC Tom 98 Nr 3 r. 2011, str. 387-428 (Artyku³) Anh Linh Nguyen, Andrzej Sza³as | |
5. | Living with Inconsistency and Taming Nonmonotonicity. Datalog Reloaded
LECTURE NOTES IN COMPUTER SCIENCE Tom 6702 r. 2011, str. 334-398 (Artyku³ konferencyjny) Jan Ma³uszuñski, Andrzej Sza³as | |
6. | Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation
JOURNAL OF APPLIED NON-CLASSICAL LOGICS Tom 21 Nr 2 r. 2011, str. 211-232 (Artyku³) Jan Ma³uszuñski, Andrzej Sza³as | |
7. | On the Web Ontology Rule Language OWL 2 RL
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Tom 6922 r. 2011, str. 254-264 (Artyku³ konferencyjny) Son Cao, Anh Linh Nguyen, Andrzej Sza³as | |
8. |
Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic
SH
TRANSACTIONS ON COMPUTATIONAL COLLECTIVE INTELLIGENCE Tom 1 r. 2010, str. 21-38 (Artyku³) Linh Anh Nguyen, Andrzej Sza³as | |
9. | A Framework for Graded Beliefs, Goals and Intentions
FUNDAMENTA INFORMATICAE Tom 100 Nr 1-4 r. 2010, str. 53-76 (Artyku³) Barbara Dunin-Kêplicz, Andrzej Sza³as, Anh Linh Nguyen | |
10. | A Layered Rule-Based Architecture for Approximate Knowledge Fusion
COMPUTER SCIENCE AND INFORMATION SYSTEMS Tom 7 Nr 3 r. 2010, str. 617-642 (Artyku³) Barbara Dunin-Kêplicz, Linh Anh Nguyen, Andrzej Sza³as | |
11. | Checking Consistency of an ABox w.r.t. Global Assumptions in PDL
FUNDAMENTA INFORMATICAE Tom 102 Nr 1 r. 2010, str. 97-113 (Artyku³) Andrzej Sza³as, Anh Linh Nguyen | |
12. | On the Correctness of Rough-Set Based Approximate Reasoning
LECTURE NOTES IN COMPUTER SCIENCE Tom 6086 r. 2010, str. 327-336 (Artyku³ konferencyjny) Patrick Doherty, Andrzej Sza³as | |
13. | Three-Valued Paraconsistent Reasoning for Semantic Web Agents
LECTURE NOTES IN COMPUTER SCIENCE Tom 6070 r. 2010, str. 152-162 (Artyku³) Andrzej Sza³as, Anh Linh Nguyen | |
14. | Tractable Approximate Knowledge Fusion Using the Horn Fragment of Serial Propositional Dynamic Logic
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING Tom 51 Nr 3 r. 2010, str. 346-362 (Artyku³) Barbara Dunin-Kêplicz, Andrzej Sza³as, Anh Linh Nguyen | |
15. | A Tableau Calculus for Regular Grammar Logics with Converse
LECTURE NOTES IN COMPUTER SCIENCE Tom 5663 r. 2009, str. 421-436 (Artyku³) Linh Anh Nguyen, Andrzej Sza³as | |
16. | Annotation Theories over Finite Graphs
STUDIA LOGICA. AN INTERNATIONAL JOURNAL FOR SYMBOLIC LOGIC Tom 93 Nr 2-3 r. 2009, str. 147-180 (Artyku³) Dov M. Gabbay, Andrzej Sza³as | |
17. | ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC
LECTURE NOTES IN COMPUTER SCIENCE Tom 5796 r. 2009, str. 473-488 (Artyku³ konferencyjny) Anh Linh Nguyen, Andrzej Sza³as | |
18. | Modeling and Reasoning with Paraconsistent Rough Sets
FUNDAMENTA INFORMATICAE Tom 97 Nr 4 r. 2009, str. 405-438 (Artyku³) Aida Vitória, Jan Ma³uszyñski, Andrzej Sza³as | |
19. | Paraconsistent Reasoning with Words
LECTURE NOTES IN COMPUTER SCIENCE Tom 5070 r. 2009, str. 43-58 (Artyku³) Alicja Sza³as, Andrzej Sza³as | |
20. | Voting by Eliminating Quantifiers
STUDIA LOGICA. AN INTERNATIONAL JOURNAL FOR SYMBOLIC LOGIC Tom 92 Nr 3 r. 2009, str. 365-379 (Artyku³) Dov M. Gabbay, Andrzej Sza³as | |
21. | Four-Valued Extension of Rough Sets
LECTURE NOTES IN COMPUTER SCIENCE Tom 5009 r. 2008, str. 106-114 (Artyku³) Aida Vitória, Andrzej Sza³as, Jan Ma³uszyñski | |
22. | Paraconsistent Logic Programs with Four-Valued Rough Sets
LECTURE NOTES IN COMPUTER SCIENCE Tom 5306 r. 2008, str. 41-51 (Artyku³) Jan Ma³uszyñski, Andrzej Sza³as, Aida Vitória | |
23. | Towards Incorporating Background Theories into Quantifier Elimination
JOURNAL OF APPLIED NON-CLASSICAL LOGICS Tom 18 Nr 2-3 r. 2008, str. 325-340 (Artyku³) Andrzej Sza³as | |
24. | Dynamics of Approximate Information Fusion
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Tom 4585 r. 2007, str. 668-677 (Artyku³ konferencyjny) P. Doherty, Barbara Dunin-Kêplicz, Andrzej Sza³as | |
25. | Second-order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals
STUDIA LOGICA. AN INTERNATIONAL JOURNAL FOR SYMBOLIC LOGIC Tom 87 r. 2007, str. 37-50 (Artyku³) D. Gabbay, Andrzej Sza³as |