Sciweavers

532 search results - page 100 / 107
» The Logic of Quasi-MV Algebras
Sort
View
ICFP
2012
ACM
12 years 6 days ago
Functional programming with structured graphs
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
Bruno C. d. S. Oliveira, William R. Cook
JAIR
2000
105views more  JAIR 2000»
13 years 9 months ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber
ACTA
1998
81views more  ACTA 1998»
13 years 9 months ago
Dijkstra-Scholten Predicate Calculus: Concepts and Misconceptions
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for correct programs. For proving the correctness of a program (i.e. the fact that...
Lex Bijlsma, Rob Nederpelt
ECOI
2007
101views more  ECOI 2007»
13 years 9 months ago
Reasoning about taxonomies in first-order logic
Experts often disagree about the organization of biological taxa. The shifting definitions of taxonomic names complicate otherwise simple queries concerning these taxa. For examp...
David Thau, Bertram Ludäscher
JAR
2000
145views more  JAR 2000»
13 years 9 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro