Sciweavers

206 search results - page 13 / 42
» Semantics, modularity, and rewriting logic
Sort
View
ISMVL
2007
IEEE
91views Hardware» more  ISMVL 2007»
14 years 5 months ago
Non-deterministic Multi-valued Matrices for First-Order Logics of Formal Inconsistency
Paraconsistent logic is the study of contradictory yet non-trivial theories. One of the best-known approaches to designing useful paraconsistent logics is da Costa’s approach, w...
Arnon Avron, Anna Zamansky
CADE
2004
Springer
14 years 4 months ago
Modular Proof Systems for Partial Functions with Weak Equality
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
Harald Ganzinger, Viorica Sofronie-Stokkermans, Uw...
ASE
2005
137views more  ASE 2005»
13 years 10 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
CORR
1999
Springer
75views Education» more  CORR 1999»
13 years 10 months ago
A System of Interaction and Structure
This paper introduces a logical system, called BV , which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challe...
Alessio Guglielmi
FLOPS
2008
Springer
14 years 12 days ago
Rewriting and Call-Time Choice: The HO Case
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Francisco Javier López-Fraguas, Juan Rodr&i...