Informal proofs formally checked by machine
Luigia Aiello, Mario Aiello, Giuseppe Attardi, Gianfranco Prini (1976)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity:
Luigia Aiello, Mario Aiello, Giuseppe Attardi, Gianfranco Prini (1976)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity:
Branko Markoski, Petar Hotomski, Dušan Malbaški, Danilo Obradović (2010)
The Yugoslav Journal of Operations Research
Similarity:
Michael Franssen, Harrie De Swart (2004)
RACSAM
Similarity:
Cocktail is a tool for deriving correct programs from their specifications. The present version is powerful enough for educational purposes. The tool yields support for many sorted first order predicate logic, formulated in a pure type system with parametric constants (CPTS), as the specification language, a simple While-language, a Hoare logic represented in the same CPTS for deriving programs from their specifications and a simple tableau based automated theorem prover for verifying...
Prešić, Slaviša B. (1997)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
James J. Lu, Jacques Calmet, Joachim Schü (1997)
Mathware and Soft Computing
Similarity:
The logic of signed formula can be used to reason about a wide variety of multiple-valued logics [Häh94b, LMR97]. The formal theoretical foundation of multiple-valued logic programming based on signed formulas is set forth in [Lu96]. The current paper is an investigation into the operational semantics of such signed logic programming. The connection of signed logic programming to constraint logic programming is presented, search space issues are briefly discussed for both general and...
Giovanni Criscuolo (1996)
Mathware and Soft Computing
Similarity:
Radosław Klimek (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Bernhard Beckert, Martin Giese, Elmar Habermalz, Reiner Hähnle, Andreas Roth, Philipp Rümmer, Steffen Schlager (2004)
RACSAM
Similarity:
Frameworks for interactive theorem proving give the user explicit control over the construction of proofs based on meta languages that contain dedicated control structures for describing proof construction. Such languages are not easy to master and thus contribute to the already long list of skills required by prospective users of interactive theorem provers. Most users, however, only need a convenient formalism that allows to introduce new rules with minimal overhead. On the the other...
Jan Štěpán (1991)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
David Pereira, Nelma Moreira (2008)
Computer Science and Information Systems
Similarity: