Sciweavers

202 search results - page 22 / 41
» Proof Search in Minimal Logic
Sort
View
CADE
2009
Springer
14 years 8 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning
RTA
2005
Springer
14 years 1 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
ATAL
2000
Springer
13 years 12 months ago
Determining the Envelope of Emergent Agent Behaviour via Architectural Transformation
In this paper we propose a methodology to help analyse tendencies in MAS to complement those of simple inspection, Monte Carlo and syntactic proof. We suggest an architecture that ...
Oswaldo Terán, Bruce Edmonds, Steve Wallis
TASE
2008
IEEE
14 years 2 months ago
Verifying BPEL-Like Programs with Hoare Logic
The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechan...
Chenguang Luo, Shengchao Qin, Zongyan Qiu
IFM
2005
Springer
14 years 1 months ago
A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
Héctor Ruíz Barradas, Didier Bert