Sciweavers

378 search results - page 24 / 76
» Proof interpretations with truth
Sort
View
LPAR
2000
Springer
14 years 6 days ago
A Tactic Language for the System Coq
We propose a new tactic language for the system goq, which is intended to enrich the current tactic combinators (tacticals). This language is based on a functional core with recurs...
David Delahaye
JACM
2000
81views more  JACM 2000»
13 years 8 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
AGP
2003
IEEE
14 years 1 months ago
Interpreting Abduction in CLP
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...
Marco Gavanelli, Evelina Lamma, Paola Mello, Miche...
BMCBI
2007
110views more  BMCBI 2007»
13 years 8 months ago
Interpretation of multiple probe sets mapping to the same gene in Affymetrix GeneChips
Background: Affymetrix GeneChip technology enables the parallel observations of tens of thousands of genes. It is important that the probe set annotations are reliable so that bio...
Maria A. Stalteri, Andrew P. Harrison
APAL
2010
98views more  APAL 2010»
13 years 8 months ago
Classical proof forestry
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
Willem Heijltjes