English
Related papers

Related papers: Machine Learning Guidance and Proof Certification …

200 papers

In this work, we reimagine classical probing to evaluate knowledge transfer from simple source to more complex target tasks. Instead of probing frozen representations from a complex source task on diverse simple target probing tasks (as…

A proof tableau of Hoare logic is an annotated program with pre- and post-conditions, which corresponds to an inference tree of Hoare logic. In this paper, we show that a proof tableau for partial correctness can be transformed into an…

Logic in Computer Science · Computer Science 2018-02-20 Shinnosuke Mizutani , Naoki Nishida

Focusing is a known technique for reducing the number of proofs while preserving derivability. Skolemisation is another technique designed to improve proof search, which reduces the number of back-tracking steps by representing dependencies…

Logic in Computer Science · Computer Science 2024-05-03 Alessandro Bruni , Eike Ritter , Carsten Schürmann

We advocate the use of conformal prediction (CP) to enhance rule-based multi-label classification (MLC). In particular, we highlight the mutual benefit of CP and rule learning: Rules have the ability to provide natural (non-)conformity…

Machine Learning · Computer Science 2020-12-09 Eyke Hüllermeier , Johannes Fürnkranz , Eneldo Loza Mencia

We introduce lower-bound certificates for classical planning tasks, which can be used to prove the unsolvability of a task or the optimality of a plan in a way that can be verified by an independent third party. We describe a general…

Artificial Intelligence · Computer Science 2025-05-06 Simon Dold , Malte Helmert , Jakob Nordström , Gabriele Röger , Tanja Schindler

Clause selection is arguably the most important choice point in saturation-based theorem proving. Framing it as a reinforcement learning (RL) task is a way to challenge the human-designed heuristics of state-of-the-art provers and to…

Artificial Intelligence · Computer Science 2025-06-03 Martin Suda

This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics…

Logic in Computer Science · Computer Science 2024-08-14 Luca Aceto , Antonis Achilleos , Elli Anastasiadi , Adrian Francalanza , Anna Ingólfsdóttir

Lookup tables (finite maps) are a ubiquitous data structure. In pure functional languages they are best represented using trees instead of hash tables. In pure functional languages within constructive logic, without a primitive integer…

Logic in Computer Science · Computer Science 2023-09-06 Andrew W Appel , Xavier Leroy

Aligning the decision-making process of machine learning algorithms with that of experienced radiologists is crucial for reliable diagnosis. While existing methods have attempted to align their diagnosis behaviors to those of radiologists…

Machine Learning · Computer Science 2025-02-10 Mingzhou Liu , Ching-Wen Lee , Xinwei Sun , Yu Qiao , Yizhou Wang

Canonical correlation analysis is a family of multivariate statistical methods for the analysis of paired sets of variables. Since its proposition, canonical correlation analysis has for instance been extended to extract relations between…

Machine Learning · Computer Science 2017-11-08 Viivi Uurtio , João M. Monteiro , Jaz Kandola , John Shawe-Taylor , Delmiro Fernandez-Reyes , Juho Rousu

We present a novel framework for machine translation evaluation using neural networks in a pairwise setting, where the goal is to select the better translation from a pair of hypotheses, given the reference translation. In this framework,…

Computation and Language · Computer Science 2019-12-09 Francisco Guzman , Shafiq Joty , Lluis Marquez , Preslav Nakov

On the one hand, checking specific termination proofs by hand, say using a particular collection of matrix interpretations, can be an arduous and error-prone task. On the other hand, automation of such checks would save time and help to…

Logic in Computer Science · Computer Science 2018-06-14 Jonas Schöpf , Christian Sternagel

Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…

Logic in Computer Science · Computer Science 2019-08-09 Simone Barlocco , Clemens Kupke , Jurriaan Rot

Recent table representation learning and data discovery methods tackle table union search (TUS) within data lakes, which involves identifying tables that can be unioned with a given query table to enrich its content. These methods are…

Information Retrieval · Computer Science 2025-05-29 Allaa Boutaleb , Bernd Amann , Hubert Naacke , Rafael Angarita

Learning embeddings for entities and relations in knowledge graph (KG) have benefited many downstream tasks. In recent years, scoring functions, the crux of KG learning, have been human-designed to measure the plausibility of triples and…

Artificial Intelligence · Computer Science 2022-03-07 Yongqi Zhang , Quanming Yao , James Tin-Yau Kwok

Many computer vision tasks address the problem of scene understanding and are naturally interrelated e.g. object classification, detection, scene segmentation, depth estimation, etc. We show that we can leverage the inherent relationships…

Computer Vision and Pattern Recognition · Computer Science 2021-03-18 Yao Lu , Sören Pirk , Jan Dlabal , Anthony Brohan , Ankita Pasad , Zhao Chen , Vincent Casser , Anelia Angelova , Ariel Gordon

Standpoint logic is a recently proposed formalism in the context of knowledge integration, which advocates a multi-perspective approach permitting reasoning with a selection of diverse and possibly conflicting standpoints rather than…

Logic in Computer Science · Computer Science 2022-05-06 Tim S. Lyon , Lucía Gómez Álvarez

Machine learning applications have become ubiquitous. Their applications range from embedded control in production machines over process optimization in diverse areas (e.g., traffic, finance, sciences) to direct user interactions like…

Learning to construct text representations in end-to-end systems can be difficult, as natural languages are highly compositional and task-specific annotated datasets are often limited in size. Methods for directly supervising language…

Computation and Language · Computer Science 2018-11-15 Marek Rei , Anders Søgaard

A dictionary is a database of standard vectors, so that other vectors / signals are expressed as linear combinations of dictionary vectors, and the task of learning a dictionary for a given data is to find a good dictionary so that the…

Machine Learning · Computer Science 2020-07-09 Mohammed Rayyan Sheriff , Debasish Chatterjee