Extending the Calculus of Looping Sequences to Model Protein Interaction at the Domain Level Roberto Barbuti, Andrea Maggiolo–Schettini, and Paolo Milazzo Dipartimento di Informatica, Universit` a di Pisa

Source URL: pages.di.unipi.it

• Logic
• Mathematics
• Automated theorem proving
• Logic programming
• Mathematical logic
• Logical truth
• Propositional calculus
• Substitution
• Sequence
• LOOP
• Constructible universe
• Ground expression

The Calculus of Looping Sequences Roberto Barbuti, Giulio Caravagna, Andrea Maggiolo–Schettini, Paolo Milazzo, and Giovanni Pardini Dipartimento di Informatica, Universit` a di Pisa Largo B. Pontecorvo 3, 56127 Pisa, I

Source URL: pages.di.unipi.it

• Biology
• Biochemistry
• Logic in computer science
• Molecular biology
• Epidermal growth factor
• Morphogens
• Protein domain
• Rewriting
• Natural computing
• RNA polymerase
• RNA

A Model-Constructing Satisfiability Calculus Leonardo de Moura1 and Dejan Jovanovi´c2 1 2 Microsoft Research

Source URL: csl.sri.com

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Logic in computer science
• Automated theorem proving
• NP-complete problems
• Electronic design automation
• Formal methods
• Conflict-driven clause learning
• Boolean satisfiability problem
• Clause
• Unit propagation

Under consideration for publication in Math. Struct. in Comp. Science Complexity of Translations from Resolution to Sequent Calculus (Presentation-Only - Draft) Giselle Reis1 and Bruno Woltzenlogel Paleo2

Source URL: pxtp.github.io

• Proof theory
• Mathematical logic
• Logic
• Mathematics
• Sequent
• Natural deduction
• Cut-elimination theorem
• Admissible rule
• Proof complexity
• Propositional calculus
• Structural rule
• Cut rule

The Design and Implementation of the Model Constructing Satisfiability Calculus Dejan Jovanovi´c Clark Barrett

Source URL: csl.sri.com

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Logic in computer science
• Constraint programming
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean satisfiability problem
• Conflict-driven clause learning
• Satisfiability modulo theories
• Unit propagation

The Calculus of Looping Sequences for Modeling Biological Membranes Roberto Barbuti Andrea Maggiolo–Schettini Paolo Milazzo Angelo Troina

Source URL: pages.di.unipi.it

• Biology
• Biotechnology
• Nucleic acids
• Molecular biology
• Epidermal growth factor
• Morphogens
• RNA
• DNA
• Protein domain
• Transmembrane protein

Stochastic Calculus of Looping Sequences for the Modelling and Simulation of Cellular Pathways Roberto Barbuti1 , Andrea Maggiolo–Schettini1, Paolo Milazzo1 , Paolo Tiberi1 , and Angelo Troina2 1

Source URL: pages.di.unipi.it

• Theoretical computer science
• Mathematics
• Logic in computer science
• Lambda calculus
• Formal languages
• Mathematical logic
• Rewriting
• Fixed-point combinator
• Sequence
• Rewrite order
• Substitution

Nordic Journal of Computing On the Expressive Power of Polyadic Synchronisation in π-calculus∗ Marco Carbone BRICS†

Source URL: www.doc.ic.ac.uk

• Process calculi
• Mathematics
• Theoretical computer science
• Logic
• -calculus
• Computability theory
• Number theory
• Process calculus
• Join-calculus
• Lambda calculus
• Distribution
• Substitution

Index calculus in class groups of non-hyperelliptic curves of genus 3 from a full cost perspective Claus Diem University of Leipzig

Source URL: www.hyperelliptic.org

• Algebraic curves
• Algebraic geometry
• Geometry
• Abstract algebra
• Group theory
• Hyperelliptic curve
• Algebraic surfaces
• Index calculus algorithm
• Elliptic curve
• Hyperelliptic curve cryptography
• Trace Zero Cryptography

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1 Model checking probabilistic and stochastic extensions of the π -calculus

Source URL: qav.comlab.ox.ac.uk