Citation Context

... ProgrammingA Brief History of Logic Programming 1930 Jacques Herbrand provides the proof-theoretical basis for automated theorem proving 1965 John Alan Robinson proposes resolution with unification =-=[11]-=- ± 1970 Robert Kowalski proposes a procedural interpretation of Horn clauses. 1972 Alain Colmerauer creates Prolog (with Philippe Roussel)A Brief History of Functional Programming 1932 Alonzo Church ...

Citation Context

...sential difference between the semantics of natural languages and that of formal languages (such as that of predicate logic, or programming languages). • The method of fragments: UG [9], EFL [8], PTQ =-=[7]-=- • The misleading form thesis (Russell, Quine) • Proposed solution to the misleading form thesis • Key challenges: quantification, anaphoric linking, tense, intensionality.Misleading Form Aristotle’s...

Citation Context

...Alloy does allow for automated checking of specifications, but only for small domains. The assumption that most software design errors show up in small domains is known as the small domain hypothesis =-=[6]-=-.Example Question Here is a question about operations on relations. Given a relation R, do the following two procedures boil down to the same thing? First take the symmetric closure, next the transit...

Citation Context

...is: there is no essential difference between the semantics of natural languages and that of formal languages (such as that of predicate logic, or programming languages). • The method of fragments: UG =-=[9]-=-, EFL [8], PTQ [7] • The misleading form thesis (Russell, Quine) • Proposed solution to the misleading form thesis • Key challenges: quantification, anaphoric linking, tense, intensionality.Misleadin...

Citation Context

...NL analysis. • Linguist Barbara Partee: “Lambda’s have changed my life.” • Computational linguistics: From Prolog to Haskell? • Appeal of Prolog: Prolog-style unification [12], ‘Parsing as Deduction’ =-=[10]-=-, useful didactic tool [1]. • But a new trend is emerging [3, 4] • NLP Resources in Haskell: see http://www.haskell.org/haskellwiki/Applications_and_ libraries/LinguisticsThe Simplest Natural Languag...

Citation Context

... is no essential difference between the semantics of natural languages and that of formal languages (such as that of predicate logic, or programming languages). • The method of fragments: UG [9], EFL =-=[8]-=-, PTQ [7] • The misleading form thesis (Russell, Quine) • Proposed solution to the misleading form thesis • Key challenges: quantification, anaphoric linking, tense, intensionality.Misleading Form Ar...

Citation Context

...bara Partee: “Lambda’s have changed my life.” • Computational linguistics: From Prolog to Haskell? • Appeal of Prolog: Prolog-style unification [12], ‘Parsing as Deduction’ [10], useful didactic tool =-=[1]-=-. • But a new trend is emerging [3, 4] • NLP Resources in Haskell: see http://www.haskell.org/haskellwiki/Applications_and_ libraries/LinguisticsThe Simplest Natural Language Engine You Can Get All A...

Citation Context

... my life.” • Computational linguistics: From Prolog to Haskell? • Appeal of Prolog: Prolog-style unification [12], ‘Parsing as Deduction’ [10], useful didactic tool [1]. • But a new trend is emerging =-=[3, 4]-=- • NLP Resources in Haskell: see http://www.haskell.org/haskellwiki/Applications_and_ libraries/LinguisticsThe Simplest Natural Language Engine You Can Get All A are B No A are B Some A are B Not all...

Citation Context

...of typed lambda calculus for NL analysis. • Linguist Barbara Partee: “Lambda’s have changed my life.” • Computational linguistics: From Prolog to Haskell? • Appeal of Prolog: Prolog-style unification =-=[12]-=-, ‘Parsing as Deduction’ [10], useful didactic tool [1]. • But a new trend is emerging [3, 4] • NLP Resources in Haskell: see http://www.haskell.org/haskellwiki/Applications_and_ libraries/Linguistics...

Citation Context

... my life.” • Computational linguistics: From Prolog to Haskell? • Appeal of Prolog: Prolog-style unification [12], ‘Parsing as Deduction’ [10], useful didactic tool [1]. • But a new trend is emerging =-=[3, 4]-=- • NLP Resources in Haskell: see http://www.haskell.org/haskellwiki/Applications_and_ libraries/LinguisticsThe Simplest Natural Language Engine You Can Get All A are B No A are B Some A are B Not all...

Citation Context

...ll not be so ambitious as to claim that our account mirrors real cognitive processes, but what we do claim is that our account imposes constraints on what the real cognitive processes can look like.” =-=[2]-=-Alternative Set-up: Clausal Form for Propositional Logic literals a literal is a proposition letter or its negation. clause a clause is a set of literals. clause sets a clause set is a set of clauses...