Logic Programming Applications: What Are the Abstractions and Implementations?

This article presents an overview of applications of logic programming, classifying them based on the abstractions and implementations of logic languages that support the applications. The three key abstractions are join, recursion, and constraint. Their essential implementations are for-loops, fixed points, and backtracking, respectively. The corresponding kinds of applications are database queries, inductive analysis, and combinatorial search, respectively. We also discuss language extensions and programming paradigms, summarize example application problems by application areas, and touch on example systems that support variants of the abstractions with different implementations

A comprehensive theory of induction and abstraction, part II

This is part II in a series of papers outlining Abstraction Theory, a theory that I propose provides a solution to the characterisation or epistemological problem of induction. Logic is built from first principles severed from language such that there is one universal logic independent of specific logical languages. A theory of (non-linguistic) meaning is developed which provides the basis for the dissolution of the `grue' problem and problems of the non-uniqueness of probabilities in inductive logics. The problem of counterfactual conditionals is generalised to a problem of truth conditions of hypotheses and this general problem is then solved by the notion of abstractions. The probability calculus is developed with examples given. In future parts of the series the full decision theory is developed and its properties explored

Type-driven natural language analysis

The purpose of this thesis is in showing how recent developments in logic programming can be exploited to encode in a computational environment the features of certain linguistic theories. We are in this way able to make available for the purpose of natural language processing sophisticated capabilities of linguistic analysis directly justified by well developed grammatical frameworks. More specifically, we exploit hypothetical reasoning, recently proposed as one of the possible directions to widen logic programming, to account for the syntax of filler-gap dependencies along the lines of linguistic theories such as Generalized Phrase Structure Grammar and Categorial Grammar. Moreover, we make use, for the purpose of semantic analysis of the same kind of phenomena, of another recently proposed extension, interestingly related to the previous one, namely the idea of replacing first-order terms with the more expressive λ-terms of λ-Calculus

Az adverbiumok mondattani és jelentéstani kérdései = The syntax and syntax-semantics interface of adverbial modification

A határozószók és a határozók alaktani, mondattani és funkcionális kérdéseit vizsgáltuk a generatív nyelvelmélet keretében, főként magyar anyag alapján. Olyan leírásra törekedtünk, melyből a különféle határozófajták mondattani viselkedése, hatóköre, valamint hangsúlyozása egyaránt következik. A különféle határozótípusok PP-ként való elemzésének lehetőségét bizonyítottuk. A határozók mondatbeli elhelyezése tekintetében a specifikálói pozíció (Cinque 1999) ellen és az adjunkciós elemzés (Ernst 2002) mellett érveltünk. Megmutattuk, hogy a határozók szórendjének levezetéséhez bal- és jobboldali adjunkció feltételezése egyaránt szükséges. A különféle határozófajták szórendi helyét mondattani, jelentéstani és prozódiai tényezők összjátékával magyaráztuk. A jelentéstani tényezők között pl. a határozók inkorporálhatóságát korlátozó típusmegszorítást, a negatív határozók kötelező fókuszálását előidéző skaláris megszorítást, egyes határozófajták és igefajták komplex eseményszerkezetének inkompatibilitását vizsgáltuk. Az ige mögötti határozók szórendjét befolyásoló prozódiai tényező például a növekvő összetevők törvénye. Megfigyeltük az intonációskifejezés- újraelemzés kiváltódásának feltételeit és jelentéstani következményeit is. A helyhatározói igekötők egy típusát a mozgatási láncok sajátos fonológiai megvalósulásaként (a fonológiailag redukált kópia inkorporációjaként) elemeztük. A tárgykörben mintegy 60 tanulmányt publikáltunk. Adverbs and Adverbial Adjuncts at the Interfaces (489 old.) c. könyvünket kiadja a Mouton de Gruyter (Berlin). | This project has aimed to clarify (on the basis of mainly Hungarian data) basic issues concerning the category "adverb", the function "adverbial", and the grammar of adverbial modification. We have argued for the PP analysis of adverbials, and have claimed that they enter the derivation via left- and right-adjunction. Their merge-in position is determined by the interplay of syntactic, semantic, and prosodic factors. The semantically motivated constraints discussed also include a type restriction affecting adverbials semantically incorporated into the verbal predicate, an obligatory focus position for scalar adverbs representing negative values of bidirectional scales, cooccurrence restrictions between verbs and adverbials involving incompatible subevents, etc. The order and interpretation of adverbials in the postverbal domain is shown to be affected by such phonologically motivated constraints as the Law of Growing Constituents, and by intonation-phrase restructuring. The shape of the light-headed chain arising in the course of locative PP incorporation is determined by morpho-phonological requirements. The types of adverbs and adverbials analyzed include locatives, temporals, comitatives, epistemic adverbs, adverbs of degree, manner, counting, and frequency, quantificational adverbs, and adverbial participles. We have published about 60 studies; our book Adverbs and Adverbial Adjuncts at the Interfaces (pp. 489) is published in the series Interface Explorations of Mouton de Gruyter, Berlin

ERBlox: Combining Matching Dependencies with Machine Learning for Entity Resolution

Entity resolution (ER), an important and common data cleaning problem, is about detecting data duplicate representations for the same external entities, and merging them into single representations. Relatively recently, declarative rules called "matching dependencies" (MDs) have been proposed for specifying similarity conditions under which attribute values in database records are merged. In this work we show the process and the benefits of integrating four components of ER: (a) Building a classifier for duplicate/non-duplicate record pairs built using machine learning (ML) techniques; (b) Use of MDs for supporting the blocking phase of ML; (c) Record merging on the basis of the classifier results; and (d) The use of the declarative language "LogiQL" -an extended form of Datalog supported by the "LogicBlox" platform- for all activities related to data processing, and the specification and enforcement of MDs.Comment: Final journal version, with some minor technical corrections. Extended version of arXiv:1508.0601