Sciweavers

3342 search results - page 52 / 669
» Automating Abstract Interpretation
Sort
View
82
Voted
SEMWEB
2007
Springer
15 years 5 months ago
Using the Dempster-Shafer Theory of Evidence to Resolve ABox Inconsistencies
Abstract. Automated ontology population using information extraction algorithms can produce inconsistent knowledge bases. Confidence values assigned by the extraction algorithms m...
Andriy Nikolov, Victoria S. Uren, Enrico Motta, An...
95
Voted
LOPSTR
2004
Springer
15 years 4 months ago
Fully Automatic Binding-Time Analysis for Prolog
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
Stephen-John Craig, John P. Gallagher, Michael Leu...
86
Voted
FLOPS
2010
Springer
15 years 4 months ago
Tag-Free Combinators for Binding-Time Polymorphic Program Generation
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Peter Thiemann, Martin Sulzmann
65
Voted
HCI
2007
15 years 11 days ago
Pictogram Retrieval Based on Collective Semantics
Abstract. To retrieve pictograms having semantically ambiguous interpretations, we propose a semantic relevance measure which uses pictogram interpretation words collected from a w...
Heeryon Cho, Toru Ishida, Rieko Inaba, Toshiyuki T...
ELP
1989
15 years 3 months ago
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
BSTRACTION, FUNCTION VARIABLES, AND SIMPLE UNIFICATION: Abstract Draft, 20 September 1989 Dale Miller Department of Computer and Information Science University of Pennsylvania Phil...
Dale Miller