Sciweavers

2062 search results - page 85 / 413
» Derivatives of Logical Formulas
Sort
View
142
Voted
TCS
2010
15 years 2 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
143
Voted
AAECC
2003
Springer
116views Algorithms» more  AAECC 2003»
15 years 9 months ago
The Jacobi Model of an Elliptic Curve and Side-Channel Analysis
Abstract. A way for preventing SPA-like attacks on elliptic curve systems is to use the same formula for the doubling and the general addition of points on the curve. Various propo...
Olivier Billet, Marc Joye
111
Voted
JCT
2007
110views more  JCT 2007»
15 years 3 months ago
Bijective counting of Kreweras walks and loopless triangulations
Abstract. We consider lattice walks in the plane starting at the origin, remaining in the first quadrant i, j ≥ 0 and made of West, South and North-East steps. In 1965, Germain ...
Olivier Bernardi
132
Voted
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
15 years 10 months ago
Optimal Tableau Algorithms for Coalgebraic Logics
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
Rajeev Goré, Clemens Kupke, Dirk Pattinson
127
Voted
JSYML
2000
110views more  JSYML 2000»
15 years 3 months ago
Basic Logic: Reflection, Symmetry, Visibility
We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and ...
Giovanni Sambin, Giulia Battilotti, Claudia Faggia...