Sciweavers

3552 search results - page 98 / 711
» Proof theory in the abstract
Sort
View
LOGCOM
2010
104views more  LOGCOM 2010»
15 years 4 months ago
Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic
Abstract. An approximate Herbrand theorem is established for firstorder infinite-valued Lukasiewicz Logic and used to obtain a proof-theoretic proof of Skolemization. These resul...
Matthias Baaz, George Metcalfe
SEMWEB
2010
Springer
15 years 4 months ago
Justification Oriented Proofs in OWL
Abstract. Justifications -- that is, minimal entailing subsets of an ontology -- are currently the dominant form of explanation provided by ontology engineering environments, espec...
Matthew Horridge, Bijan Parsia, Ulrike Sattler
ENTCS
2008
79views more  ENTCS 2008»
15 years 6 months ago
Experimenting Formal Proofs of Petri Nets Refinements
Petri nets are a formalism for modelling and validating critical systems. Generally, the approach to specification starts from an abstract view of the system under study. Once val...
Christine Choppy, Micaela Mayero, Laure Petrucci
ENTCS
2002
152views more  ENTCS 2002»
15 years 6 months ago
Abstract Logics as Dialgebras
Logics as Dialgebras Alessandra Palmigiano Departament de L`ogica, Hist`oria i Filosofia de la Ci`encia, Universitat de Barcelona The aim of this report is to propose a line of re...
Alessandra Palmigiano
FC
2005
Springer
134views Cryptology» more  FC 2005»
15 years 12 months ago
Analysis of a Multi-party Fair Exchange Protocol and Formal Proof of Correctness in the Strand Space Model
Abstract. A multi-party fair exchange protocol is a cryptographic protocol allowing several parties to exchange commodities in such a way that everyone gives an item away if and on...
Aybek Mukhamedov, Steve Kremer, Eike Ritter