Sciweavers

2623 search results - page 70 / 525
» Hoare Logic in the Abstract
Sort
View
LOGCOM
2010
104views more  LOGCOM 2010»
14 years 8 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
DLOG
2010
14 years 7 months ago
Paraconsistent Description Logics Revisited
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-...
Norihiro Kamide
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
15 years 3 months ago
Information Flow Analysis in Logical Form
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
Torben Amtoft, Anindya Banerjee
CSMR
1998
IEEE
15 years 2 months ago
A Metrics Suite for Concurrent Logic Programs
AbstractA large body of research in the measurement of software complexity has been focused on imperative programs, but little eort has been made for logic programs. In this paper,...
Jianjun Zhao, Jingde Cheng, Kazuo Ushijima
ENTCS
2006
142views more  ENTCS 2006»
14 years 9 months ago
The Rewriting Logic Semantics Project
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding th...
José Meseguer, Grigore Rosu