Journal Publications
| Show abstracts (where available) BibTeX entries | ||
| 2024 | ||
| [55] |
.
2024. Modeling and shadowing paraconsistent BDI agents. Annals of Mathematics and Artificial Intelligence, 92(??):855–876. SPRINGER. DOI: 10.1007/s10472-023-09902-w. Note: Funding Agencies|Narodowe Centrum Nauki [2015/19/B/ST6/02589]; National Science Centre Poland Fulltext: https://doi.org/10.1007/s10472-023-09902... fulltext:print: https://liu.diva-portal.org/smash/get/di... |
|
| [54] |
.
2024. Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions. Artificial Intelligence, 326(??):??–??. ELSEVIER. DOI: 10.1016/j.artint.2023.104036. Note: Funding Agencies|ELLIIT Network Organization for Information and Communication Technology, Sweden; Mahasarakham Development Fund, Mahasarakham University, Thailand; National Science Centre Poland [2017/27/B/ST6/02018] Fulltext: https://doi.org/10.1016/j.artint.2023.10... fulltext:print: https://liu.diva-portal.org/smash/get/di... |
|
| 2022 | ||
| [53] |
.
2022. A landscape and implementation framework for probabilistic rough sets using PROBLOG. Information Sciences, 593(??):546–576. Elsevier Science Inc. DOI: 10.1016/j.ins.2021.12.062. Note: Funding Agencies|ELLIIT Network Organization for Information and Communication Technology, Sweden; Swedish Foundation for Strategic Research SSF [RIT15-0097]; Guangdong Department of Science and Technology, China [2020A1313030098]; National Science Centre Poland [2017/27/B/ST6/02018] fulltext:print: http://liu.diva-portal.org/smash/get/div... |
|
| 2021 | ||
| [52] |
.
2021. Rough set reasoning using answer set programs. International Journal of Approximate Reasoning, 130(March):126–149. Elsevier. DOI: 10.1016/j.ijar.2020.12.010. Note: Funding: ELLIIT Network Organization for Information and Communication Technology, Sweden; Swedish Foundation for Strategic Research SSF(Smart Systems Project) [RIT15-0097]; Jinan University (Zhuhai Campus); National Science Centre PolandNational Science Centre, Poland [2017/27/B/ST6/02018] Fulltext: https://doi.org/10.1016/j.ijar.2020.12.0... fulltext:print: http://liu.diva-portal.org/smash/get/div... |
|
| 2020 | ||
| [51] |
.
2020. On the Probability and Cost of Ignorance, Inconsistency, Nonsense and More. Journal of Multiple-Valued Logic and Soft Computing, 34(5-6):423–450. Old City Publishing. Note: Funding agencies: National Science Centre PolandNational Science Center, PolandNational Science Centre, Poland [2017/27/B/ST6/02018] Journal home page: https://www.oldcitypublishing.com/journa... |
|
| [50] |
.
2020. A Paraconsistent ASP-like Language with Tractable Model Generation. Journal of Applied Logics - IfCoLog Journal of Logic and Applications, 7(3):361–389. College Publications. Note: Funding agencies: This work has been supported by grant 2017/27/B/ST6/02018 of the National Science Centre Poland. Link to article: http://www.collegepublications.co.uk/dow... fulltext:print: http://liu.diva-portal.org/smash/get/div... |
|
| 2019 | ||
| [49] |
.
2019. A paraconsistent approach to actions in informationally complex environments. Annals of Mathematics and Artificial Intelligence, 86(4):231–255. SPRINGER. DOI: 10.1007/s10472-019-09627-9. Note: Funding Agencies|Polish National Science Centre [2015/19/B/ST6/02589]; ELLIIT Network Organization for Information and Communication Technology; Swedish Foundation for Strategic Research FSR (SymbiKBot Project) fulltext:print: http://liu.diva-portal.org/smash/get/div... |
|
| [48] |
.
2019. Paraconsistent Reasoning in Cops and Robber Game with Uncertain Information: A Simulation-Based Analysis. International Journal of Uncertainty Fuzziness and Knowledge-Based Systems, 27(3):429–455. WORLD SCIENTIFIC PUBL CO PTE LTD. DOI: 10.1142/S021848851950020X. Note: Funding Agencies|Polish National Science Centre [2012/05/B/ST6/03094, 2015/19/B/ST6/02589] |
|
| 2018 | ||
| [47] |
.
2018. Paraconsistent Rule-Based Reasoning with Graded Truth Values. Journal of Applied Logics - IfCoLog Journal, 5(1):185–220. College Publications. Link: http://www.collegepublications.co.uk/dow... |
|
| 2015 | ||
| [46] |
.
2015. Towards richer rule languages with polynomial data complexity for the Semantic Web. Data & Knowledge Engineering, 96-97(??):57–77. ELSEVIER SCIENCE BV. DOI: 10.1016/j.datak.2015.04.005. |
|
| [45] |
.
2015. Paraconsistent semantics of speech acts. |
|
| 2014 | ||
| [44] |
.
2014. A Horn Fragment with PTime Data Complexity of Regular Description Logic with Inverse. VNU Journal of Computer Science and Communication Engineering, 30(4):14–28. Link to publication: http://www.jcsce.vnu.edu.vn/index.php/jc... |
|
| [43] |
.
2014. WORL: a nonmonotonic rule language for the semantic web. |
|
| 2013 | ||
| [42] |
.
2013. Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination. Fundamenta Informaticae, 127(1-4):135–149. IOS Press. DOI: 10.3233/FI-2013-900. Note: Funding Agencies|Swedish Research Council (VR) Linnaeus Center CADICS||ELLIIT Excellence Center at Linkoping-Lund in Information Technology||CUAS project||SSF, the Swedish Foundation for Strategic Research|| |
|
| [41] |
.
2013. How an agent might think. Logic journal of the IGPL (Print), 21(3):515–535. Oxford University Press (OUP): Policy A - Oxford Open Option A. DOI: 10.1093/jigpal/jzs051. |
|
| 2011 | ||
| [40] |
.
2011. Converse-PDL with Regular Inclusion Axioms: A Framework for MAS Logics. |
|
| [39] |
.
2011. ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse. Studia Logica: An International Journal for Symbolic Logic, 98(3):387–428. Springer Berlin/Heidelberg. DOI: 10.1007/s11225-011-9341-3. |
|
| [38] |
.
2011. Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation. |
|
| 2010 | ||
| [37] |
.
2010. Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH. Transactions on Computational Collective Intelligence, 1(1):21–38. Springer. ISBN: 978-3-642-15033-3. DOI: 10.1007/978-3-642-15034-0_2. |
|
| [36] |
.
2010. Checking Consistency of an ABox w.r.t. Global Assumptions in PDL. |
|
| [35] |
.
2010. A Framework for Graded Beliefs, Goals and Intentions. |
|
| [34] |
.
2010. A Layered Rule-Based Architecture for Approximate Knowledge Fusion. COMPUTER SCIENCE AND INFORMATION SYSTEMS, 7(3):617–642. COMSIS CONSORTIUM. DOI: 10.2298/CSIS100209015D. |
|
| [33] |
.
2010. Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic. International Journal of Approximate Reasoning, 51(3):346–362. Elsevier. DOI: 10.1016/j.ijar.2009.11.002. |
|
| 2009 | ||
| [32] |
.
2009. Annotation Theories over Finite Graphs. Studia Logica: An International Journal for Symbolic Logic, 93(2-3):147–180. Springer. DOI: 10.1007/s11225-009-9220-3. |
|
| [31] |
.
2009. Voting by Eliminating Quantifiers. Studia Logica: An International Journal for Symbolic Logic, 92(3):365–379. Springer. DOI: 10.1007/s11225-009-9200-7. |
|
| 2008 | ||
| [30] |
.
2008. Towards Incorporating Background Theories into Quantifier Elimination. Journal of applied non-classical logics, 18(2-3):325–340. Éditions Hermès-Lavoisier. DOI: 10.3166/jancl.18.325-340. |
|
| 2007 | ||
| [29] |  |
.
2007. Communication between agents with heterogeneous perceptual capabilities. |
| [28] | |
.
2007. Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals. Studia Logica: An International Journal for Symbolic Logic, 87(1):37–50. Springer. DOI: 10.1007/s11225-007-9075-4. |
| [27] | |
.
2007. A correspondence framework between three-valued logics and similarity-based approximate reasoning. Fundamenta Informaticae, 75(1-4):179–193. IOS Press. |
| 2006 | ||
| [26] |
.
2006. Second-order Reasoning in Description Logics. Journal of applied non-classical logics, 16(3 - 4):517–530. Éditions Hermès-Lavoisier. DOI: 10.3166/jancl.16.517-530. |
|
| [25] | |
.
2006. Approximate Databases: A support tool for approximate reasoning. Journal of applied non-classical logics, 16(1-2):87–118. Éditions Hermès-Lavoisier. DOI: 10.3166/jancl.16.87-117. Note: Special issue on implementation of logics |
| 2003 | ||
| [24] |
.
2003. Preface. Fundamenta Informaticae, 57(2-4):i–iii. IOS Press. |
|
| [23] | |
.
2003. Towards a framework for approximate ontologies. Fundamenta Informaticae, 57(2-4):147–165. IOS Press. |
| 1999 | ||
| [22] | |
.
1999. Meta-queries on deductive databases. |
| [21] | |
.
1999. Declarative PTIME queries for relational databases using quantifier elimination. Journal of logic and computation (Print), 9(5):737–758. Oxford University Press. DOI: 10.1093/logcom/9.5.737. |
| 1998 | ||
| [20] |
.
1998. General domain circumscription and its effective reductions. |
|
| 1997 | ||
| [19] | |
.
1997. Computing circumscription revisited: A reduction algorithm. Journal of automated reasoning, 18(3):297–336. Kluwer Academic Publishers. DOI: 10.1023/A:1005722130532. |
| 1996 | ||
| [18] |
.
1996. On Natural Deduction in First-Order Fixpoint Logics. |
|
| [17] | |
.
1996. A reduction result for circumscribed semi-horn formulas. |
| 1994 | ||
| [16] |
.
1994. On an Automated Translation of Modal Proof Rules into Formulas of the Classical Logic. Journal of Applied Non-Classical Logics, 4(2):119–127. Éditions Hermès-Lavoisier. |
|
| 1993 | ||
| [15] |
.
1993. On the Correspondence between Modal and Classical Logic: An Automated Approach. Journal of logic and computation (Print), 3(6):605–620. Oxford University Press. DOI: 10.1093/logcom/3.6.605. |
|
| 1992 | ||
| [14] |
.
1992. Axiomatizing Fixpoint Logics. |
|
| 1991 | ||
| [13] |
.
1991. On Strictly Arithmetical Completeness in Logics of Programs. |
|
| 1989 | ||
| [12] |
.
1989. On Temporal Logic for Distributed Systems and its Application to Processes Communicating by Interrupts. Fundamenta Informaticae, 12(2):191–204. IOS Press. |
|
| 1988 | ||
| [11] |
.
1988. Towards the Temporal Approach to Abstract Data Types. Fundamenta Informaticae, 11(1):49–64. IOS Press. |
|
| [10] |
.
1988. An Incompleteness Result in Process Algebra. |
|
| [9] |
.
1988. Propositional Description of Finite Cause-Effect Structures. |
|
| [8] |
.
1988. Incompleteness of First-Order Temporal Logic with Until. |
|
| 1987 | ||
| [7] |
.
1987. A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time. |
|
| [6] |
.
1987. Arithmetical Axiomatization of First-Order Temporal Logic. |
|
| 1986 | ||
| [5] |
.
1986. Concerning the Semantic Consequence Relation in First-Order Temporal Logic. |
|
| 1985 | ||
| [4] |
.
1985. A Note on PCI: Distributed Processes Communicating by Interrupts. |
|
| [3] |
.
1985. Exception Handling in Parallel Computations. |
|
| 1984 | ||
| [2] |
.
1984. On an Application of Algorithmic Theory of Stacks. Fundamenta Informaticae, 7(3):378–388. IOS Press. |
|
| 1981 | ||
| [1] |
.
1981. Algorithmic Logic with Recursive Functions. Fundamenta Informaticae, 4(4):975–995. IOS Press. |
|
