Logics for stable and unstable mereological relations. (English)
Cent. Eur. J. Math. 9, No. 6, 1354-1379 (2011).
1
On the elimination of quantifier-free cuts. (English)
Theor. Comput. Sci. 412, No. 49, 6843-6854 (2011).
2
Approximate invariant property checking using term-height reduction for a subset of first-order logic. (English)
Cha, Sungdeok (Steve) (ed.) et al., Automated technology for verification and analysis. 6th international symposium, ATVA 2008, Seoul, Korea, October 20‒23, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-88386-9/pbk). Lecture Notes in Computer Science 5311, 318-331 (2008).
3
Zero, successor and equality in BDDs. (English)
Ann. Pure Appl. Logic 133, No. 1-3, 101-123 (2005).
4
Specification by quantifier-free theory of superlinear inequalities and complexity of its decidability. (English)
An. Ştiinţ. Univ. Al. I. Cuza Iaşi, Ser. Nouă, Inf. 8, 114-120 (1999).
5
Tableau calculi for hybrid logics. (English)
Murray, Neil V. (ed.), Automated reasoning with analytic tableaux and related methods. International conference, TABLEAUX ‘99, Saratoga Springs, NY, USA, June 7‒11, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1617, 278-292 (1999).
6
Succinctness as a source of complexity in logical formalisms. (English)
Ann. Pure Appl. Logic 97, No.1-3, 231-260 (1999).
7
The addition of bounded quantification and partial functions to a computational logic and its theorem prover. (English)
J. Autom. Reasoning 4, No.2, 117-172 (1988).
8
Equational methods in first order predicate calculus. (English)
J. Symb. Comput. 1, 7-29 (1985).
9
Start
Contact
Print
General Help
