Sciweavers

158 search results - page 21 / 32
» Representing Procedural Logic in XML
Sort
View
LICS
2008
IEEE
14 years 1 months ago
Cut Elimination for Monomial MALL Proof Nets
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
Olivier Laurent, Roberto Maieli
DATE
2003
IEEE
92views Hardware» more  DATE 2003»
14 years 26 days ago
Local Search for Boolean Relations on the Basis of Unit Propagation
We propose a method for local search of Boolean relations relating variables of a CNF formula. The method is to branch on small subsets of the set of CNF variables and to analyze ...
Yakov Novikov
CADE
2008
Springer
14 years 7 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
CORR
2004
Springer
120views Education» more  CORR 2004»
13 years 7 months ago
Validating a Web Service Security Abstraction by Typing
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...
Andrew D. Gordon, Riccardo Pucella
ICDS
2010
IEEE
14 years 26 days ago
Modeling and Analysis of Laws Using BPR and Goal-Oriented Framework
Abstract—Recently, two complementary approaches are proposed to represent, model and analyze laws: the Nomos and VLPM approaches. Nomos is a goal-oriented approach to effectively...
Adolfo Villafiorita, Komminist Weldemariam, Angelo...