Sciweavers

419 search results - page 34 / 84
» Translation of Aggregate Programs to Normal Logic Programs
Sort
View
COLING
2000
13 years 9 months ago
Learning Semantic-Level Information Extraction Rules by Type-Oriented ILP
This paper describes an approach to using semantic rcprcsentations for learning information extraction (IE) rules by a type-oriented inductire logic programming (ILl)) system. NLP...
Yutaka Sasaki, Yoshihiro Matsuo
POPL
2004
ACM
14 years 8 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
JAR
2010
108views more  JAR 2010»
13 years 6 months ago
Procedural Representation of CIC Proof Terms
Abstract. In this paper we propose an effective procedure for translating a proof term of the Calculus of Inductive Constructions (CIC), which is very similar to a program written...
Ferruccio Guidi
PPDP
2004
Springer
14 years 1 months ago
Characterizing strong normalization in a language with control operators
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...
Daniel J. Dougherty, Silvia Ghilezan, Pierre Lesca...
BANFF
1995
13 years 11 months ago
An Automata-Theoretic Approach to Linear Temporal Logic
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs ...
Moshe Y. Vardi