Journal Publications
| Show abstracts (where available) BibTeX entries | ||
| 2011 | ||
| [39] |
.
2011. Converse-PDL with Regular Inclusion Axioms: A Framework for MAS Logics. |
|
| [38] |
.
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. |
|
| [37] |
.
2011. Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation. |
|
| 2010 | ||
| [36] |
.
2010. Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH. Transactions on Computational Collective Intelligence, ??(1):21–38. Springer. ISBN: 978-3-642-15033-3. DOI: 10.1007/978-3-642-15034-0_2. |
|
| [35] |
.
2010. Checking Consistency of an ABox w.r.t. Global Assumptions in PDL. |
|
| [34] |
.
2010. A Framework for Graded Beliefs, Goals and Intentions. |
|
| [33] |
.
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. |
|
| [32] |
.
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 | ||
| [31] |
.
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. |
|
| [30] |
.
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 | ||
| [29] |
.
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 | ||
| [28] |  |
.
2007. Communication between agents with heterogeneous perceptual capabilities. |
| [27] | |
.
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. |
| [26] | |
.
2007. A correspondence framework between three-valued logics and similarity-based approximate reasoning. Fundamenta Informaticae, 75(1-4):179–193. IOS Press. |
| 2006 | ||
| [25] |
.
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. |
|
| [24] | |
.
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 | ||
| [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(??):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. |
|
