Automated theorem proving in monadic predicate calculus
Jan Štěpán (1991)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Jan Štěpán (1991)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
Karel Čulík (1972)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Andrzej Pułka (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Andrzej Pułka (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Prešić, Slaviša B. (1997)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Adam Meissner (2011)
International Journal of Applied Mathematics and Computer Science
Similarity:
A computation rule determines the order of selecting premises during an inference process. In this paper we empirically analyse three particular computation rules in a tableau-based, parallel reasoning system for the ALC description logic, which is built in the relational programming model in the Oz language. The system is constructed in the lean deduction style, namely, it has the form of a small program containing only basic mechanisms, which assure soundness and completeness of reasoning....