Sciweavers

367 search results - page 59 / 74
» Temporal Reasoning for Procedural Programs
Sort
View
MCMASTER
1993
14 years 21 days ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
PODS
2005
ACM
99views Database» more  PODS 2005»
14 years 8 months ago
XML type checking with macro tree transducers
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...
SEMWEB
2010
Springer
13 years 6 months ago
Experience of Using OWL Ontologies for Automated Inference of Routine Pre-operative Screening Tests
We describe our experience of designing and implementing a knowledge-based pre-operative assessment decision support system. We developed the system using semantic web technology, ...
Matt-Mouley Bouamrane, Alan L. Rector, Martin Hurr...
VSTTE
2012
Springer
12 years 4 months ago
Deciding Functional Lists with Sublist Sets
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
Thomas Wies, Marco Muñiz, Viktor Kuncak
ILP
2003
Springer
14 years 1 months ago
Hybrid Abductive Inductive Learning: A Generalisation of Progol
The learning system Progol5 and the underlying inference method of Bottom Generalisation are firmly established within Inductive Logic Programming (ILP). But despite their success...
Oliver Ray, Krysia Broda, Alessandra Russo