BibSonomy publications for /user/diego_ma/prologFri Dec 14 02:46:58 CET 2007Cambridge (MA)The Art of Prolog1986prolog Fri Dec 14 02:46:35 CET 2007Artificial Intelligence Techniques in Prolog1994AI prolog Fri Dec 14 02:44:13 CET 2007Theory and Practice of Logic ProgrammingParsing Natural Languages with {CHR}Submittedcostraint_programming robust_parsing prolog property_grammar In this paper, parsing as deduction and constraint programming are brought together to outline a procedure for the specification of constraint-based (chart) parsers. Extending the proposal in Shieber (1995) which provides a meta interpreter for several deduction systems, we show how to directly realize the inference rules for chart parsers as Constraint Handling Rules ({Fr\"{u}hwirth}, 1998) by viewing the items of a conventional chart parser as constraints and the constraint base as a chart. This allows the direct use of the constraint resolution process to parse sentences in diverse natural language formalisms such as minimalist grammars (Stabler, 1997; Stabler, 2001) or property grammars (Blache, 2000; Balfourier et al., 2002).Fri Dec 14 02:39:20 CET 2007Wokingham, EnglandNatural Language Processing in {PROLOG}1989NLP prolog Fri Dec 14 02:37:46 CET 2007AI-1994-06{GULP} 3.1: An Extension of Prolog for Unification-Based Grammar1994NLP grammar prolog Fri Dec 14 02:37:45 CET 2007Englewood Cliffs, NJNatural Language Processing for Prolog Programmers1994NLP prolog Fri Dec 14 02:37:44 CET 2007Applied Artificial IntelligenceNatural Language Plurals in Logic Programming Queriesforthcomingplural logic_programming prolog Fri Dec 14 02:37:23 CET 2007\myurl{http://www.dat.ruc.dk/\~{}henning/chrg/CHRGusersGuide.html}NovemberVisited 28 August 2003User's Guide to CHR Grammars2002constraint_programming grammar prolog This document explains how to use CHRG which is a grammar notation implemented on top of the CHR language of Constraint Handling Rules. CHR is an extension to Prolog with committed choice multiple-headed rules. You need to have a recent version of SICSTUS Prolog installed on your computer that supports the CHR library.Fri Dec 14 02:37:22 CET 2007Submitted to journal Theory and Practice of Logic ProgrammingCHR Grammmars2002constraint_programming grammar prolog A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena...Fri Dec 14 02:37:17 CET 2007Proc. TABLEAUX 2002Also in Proc. NLULP 2002251-265Lecture Notes in Artificial Intelligence 2381Question Answering: From Partitions to Prolog2002semantics questions prolog We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tableau theorem proving. The algorithm relies on a syntactic characterization of answerhood: Any answer to a question is equivalent to some formula built up only from instances of the question. We prove this characterization by translating the logic of interrogation to classical predicate logic and applying Craig's interpolation theorem.Fri Dec 14 02:37:07 CET 2007On-line publicationA Prolog {CGI} Interface1999prolog computer This document describes how Prolog can be used as part of the Common Gateway Interface (CGI) [for more information on CGI, check out the University of Kansas CGI Intro or the NCSA CGI Intro] in order to process HTML Forms. As an example, we use the Type-Logical Grammar Theorem Prover.