Sciweavers

1143 search results - page 164 / 229
» Abstract Syntax and Logic Programming
Sort
View
EACL
2006
ACL Anthology
14 years 11 months ago
XMG - An Expressive Formalism for Describing Tree-Based Grammars
In this paper1 we introduce eXtensible MetaGrammar, a system that facilitates the development of tree based grammars. This system includes both (1) a formal language adapted to th...
Yannick Parmentier, Joseph Le Roux, Benoît C...
INTERACTION
2009
ACM
15 years 4 months ago
DTD2OWL: automatic transforming XML documents into OWL ontology
DTD and its instance have been considered the standard for data representation and information exchange format on the current web. However, when coming to the next generation of w...
Pham Thi Thu Thuy, Young-Koo Lee, Sungyoung Lee
105
Voted
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
15 years 3 months ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
88
Voted
CORR
2006
Springer
143views Education» more  CORR 2006»
14 years 10 months ago
A Knowledge-Based Approach for Selecting Information Sources
Through the Internet and the World-Wide Web, a vast number of information sources has become available, which offer information on various subjects by different providers, often i...
Thomas Eiter, Michael Fink, Hans Tompits
97
Voted
CADE
2002
Springer
15 years 10 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...