Sciweavers

2145 search results - page 165 / 429
» Lax Logical Relations
Sort
View
95
Voted
PEPM
2007
ACM
15 years 6 months ago
Quasi-terminating logic programs for ensuring the termination of partial evaluation
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Germán Vidal
74
Voted
CSB
2005
IEEE
126views Bioinformatics» more  CSB 2005»
15 years 6 months ago
Visualization of Logic Analysis of Phylogenetic Profiles (LAPP)
Recently Bowers et al. [1] analyzed triplet logic relationships among 4873 Clusters of Orthologous Groups (COGS) from 67 fully sequenced organisms by calculating how well logic re...
Kay A. Robbins, Li Zhao
122
Voted
ECAI
2004
Springer
15 years 6 months ago
Towards a Logical Analysis of Biochemical Reactions
We provide a logical model of biochemical reactions and show how hypothesis generation using weakest sufficient and strongest necessary conditions may be used to provide addition...
Patrick Doherty, Steve Kertes, Martin Magnusson, A...
132
Voted
FSTTCS
1999
Springer
15 years 5 months ago
Hoare Logic for Mutual Recursion and Local Variables
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
David von Oheimb
100
Voted
CSL
1998
Springer
15 years 5 months ago
Revision Programming = Logic Programming + Integrity Constraints
We study revision programming, a logic-based mechanism for enforcing constraints on databases. The central concept of this approach is that of a justi ed revision based on a revisi...
V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczyns...