English
Related papers

Related papers: Pattern Matching via Choice Existential Quantifica…

200 papers

Term rewriting systems have a simple syntax and semantics and facilitate proofs of correctness. However, they are not as popular in industry or academia as imperative languages. We define a term rewriting based abstract programming language…

Programming Languages · Computer Science 2020-07-08 David Plaisted , Lee Barnett

Existential rules are a very popular ontology-mediated query language for which the chase represents a generic computational approach for query answering. It is straightforward that existential rule queries exhibiting chase termination are…

Logic in Computer Science · Computer Science 2021-07-19 Camille Bourgaux , David Carral , Markus Krötzsch , Sebastian Rudolph , Michaël Thomazo

Probabilistic programming is considered as a framework, in which basic components of cognitive architectures can be represented in unified and elegant fashion. At the same time, necessity of adopting some component of cognitive…

Artificial Intelligence · Computer Science 2016-05-05 Alexey Potapov

Quantified constraints over the reals appear in numerous contexts. Usually existential quantification occurs when some parameter can be chosen by the user of a system, and univeral quantification when the exact value of a parameter is…

Logic in Computer Science · Computer Science 2025-07-23 Stefan Ratschan

In this paper, we consider existential rules, an expressive formalism well suited to the representation of ontological knowledge and data-to-ontology mappings in the context of ontology-based data integration. The chase is a fundamental…

Artificial Intelligence · Computer Science 2021-07-14 Maxime Buron , Marie-Laure Mugnier , Michaël Thomazo

We consider interactive tools that help users search for their most preferred item in a large collection of options. In particular, we examine example-critiquing, a technique for enabling users to incrementally construct preference models…

Artificial Intelligence · Computer Science 2011-10-04 B. Faltings , P. Pu , P. Viappiani

SelectScript is an extendable, adaptable, and declarative domain-specific language aimed at information retrieval from simulation environments and robotic world models in an SQL-like manner. In this work we have extended the language in two…

Programming Languages · Computer Science 2015-10-06 André Dietrich , Sebastian Zug , Luigi Nardi , Jörg Kaiser

We introduce a type and effect system, for an imperative object calculus, which infers "sharing" possibly introduced by the evaluation of an expression, represented as an equivalence relation among its free variables. This direct…

Programming Languages · Computer Science 2018-08-03 Paola Giannini , Tim Richter , Marco Servetto , Elena Zucca

Verbs are important in semantic understanding of natural language. Traditional verb representations, such as FrameNet, PropBank, VerbNet, focus on verbs' roles. These roles are too coarse to represent verbs' semantics. In this paper, we…

Computation and Language · Computer Science 2017-10-24 Wanyun Cui , Xiyou Zhou , Hangyu Lin , Yanghua Xiao , Haixun Wang , Seung-won Hwang , Wei Wang

Nontransitive choices have long been an area of curiosity within economics. However, determining whether nontransitive choices represent an individual's preference is a difficult task since choice data is inherently stochastic. This paper…

Theoretical Economics · Economics 2023-05-01 Mogens Fosgerau , John Rehbeck

This thesis investigates effectful declarative programming with an emphasis on non-determinism as an effect. On the one hand, we are interested in developing applications using non-determinism as underlying implementation idea. We discuss…

Programming Languages · Computer Science 2020-06-03 Sandra Dylus

We use a probabilistic method to produce some combinatorial inequalities by considering pattern containment in permutations and words.

Combinatorics · Mathematics 2007-05-23 Alexander I. Burstein

We investigate how to model exchangeability with choice functions. Exchangeability is a structural assessment on a sequence of uncertain variables. We show how such assessments are a special indifference assessment, and how that leads to a…

Artificial Intelligence · Computer Science 2017-03-07 Arthur Van Camp , Gert de Cooman

Providing users with alternatives to choose from is an essential component in many online platforms, making the accurate prediction of choice vital to their success. A renewed interest in learning choice models has led to significant…

Machine Learning · Computer Science 2020-01-22 Nir Rosenfeld , Kojin Oshiba , Yaron Singer

The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof procedure as exemplified by the chase algorithm. In this paper we present a complete axiomatization of embedded…

Logic in Computer Science · Computer Science 2015-07-03 Miika Hannula

Existential rule languages are a family of ontology languages that have been widely used in ontology-mediated query answering (OMQA). However, for most of them, the expressive power of representing domain knowledge for OMQA, known as the…

Logic in Computer Science · Computer Science 2021-12-20 Heng Zhang

We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…

Logic · Mathematics 2014-02-20 Asaf Karagila

Statistical models of word-sense disambiguation are often based on a small number of contextual features or on a model that is assumed to characterize the interactions among a set of features. Model selection is presented as an alternative…

cmp-lg · Computer Science 2008-02-03 Ted Pedersen , Rebecca Bruce , Janyce Wiebe

Multiple choice benchmarks have long been the workhorse of language model evaluation because grading multiple choice is objective and easy to automate. However, we show multiple choice questions from popular benchmarks can often be answered…

Computation and Language · Computer Science 2025-07-04 Nikhil Chandak , Shashwat Goel , Ameya Prabhu , Moritz Hardt , Jonas Geiping

We give a finite-sample analysis of predictive inference procedures after model selection in regression with random design. The analysis is focused on a statistically challenging scenario where the number of potentially important…

Statistics Theory · Mathematics 2009-08-26 Hannes Leeb