Sciweavers

911 search results - page 36 / 183
» Prolog and Natural-Language Analysis
Sort
View
EJC
2008
13 years 11 months ago
Center Fragments for Upscaling and Verification in Database Semantics
The notion of a fragment was coined by Montague 1974 to illustrate the formal handling of certain puzzles, such as de dicto/de re, in a truth-conditional semantics for natural lan...
Roland Hausser
LOPSTR
2009
Springer
14 years 4 months ago
A Transformational Approach for Proving Properties of the CHR Constraint Store
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
Paolo Pilozzi, Tom Schrijvers, Maurice Bruynooghe
ENTCS
2007
134views more  ENTCS 2007»
13 years 10 months ago
Improving the Decompilation of Java Bytecode to Prolog by Partial Evaluation
The interpretative approach to compilation allows compiling programs by partially evaluating an interpreter w.r.t. a source program. This approach, though very attractive in princ...
Miguel Gómez-Zamalloa, Elvira Albert, Germ&...
CORR
2002
Springer
114views Education» more  CORR 2002»
13 years 9 months ago
Offline Specialisation in Prolog Using a Hand-Written Compiler Generator
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalu...
Michael Leuschel, Jesper Jørgensen, Wim Van...
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
14 years 4 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...