Sciweavers

119 search results - page 6 / 24
» Normal Forms for Knowledge Compilation
Sort
View
MFCS
1997
Springer
13 years 12 months ago
Simulation as a Correct Transformation of Rewrite Systems
Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in...
Wan Fokkink, Jaco van de Pol
IJPRAI
2000
108views more  IJPRAI 2000»
13 years 7 months ago
Knowledge Base Reformation: Preparing First-Order Theories for Efficient Propositional Reasoning
We present an approach to knowledge compilation that transforms a function-free first-order Horn knowledge base to propositional logic. This form of compilation is important since...
Helmut Prendinger, Mitsuru Ishizuka, Gerhard Schur...
AAAI
2006
13 years 9 months ago
Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
Yolifé Arvelo, Blai Bonet, Maria-Esther Vid...
LREC
2008
85views Education» more  LREC 2008»
13 years 9 months ago
A Method for Automatically Constructing Case Frames for English
Case frames are an important knowledge base for a variety of natural language processing (NLP) systems. For the practical use of these systems in the real world, wide-coverage cas...
Daisuke Kawahara, Kiyotaka Uchimoto
APCSAC
2001
IEEE
13 years 11 months ago
Stacking them up: a Comparison of Virtual Machines
A popular trend in current software technology is to gain program portability by compiling programs to an inte form based on an abstract machine definition. Such approaches date b...
K. John Gough