English
Related papers

Related papers: MACE 2.0 Reference Manual and Guide

200 papers

Automated theorem proving has long been a key task of artificial intelligence. Proofs form the bedrock of rigorous scientific inquiry. Many tools for both partially and fully automating their derivations have been developed over the last…

Artificial Intelligence · Computer Science 2018-10-15 Brian Groenke

This course, intended for undergraduates familiar with elementary calculus and linear algebra, introduces the extension of differential calculus to functions on more general vector spaces, such as functions that take as input a matrix and…

History and Overview · Mathematics 2025-01-28 Paige Bright , Alan Edelman , Steven G. Johnson

As was shown recently, many important AI problems require counting the number of models of propositional formulas. The problem of counting models of such formulas is, according to present knowledge, computationally intractable in a worst…

Artificial Intelligence · Computer Science 2011-06-02 E. Birnbaum , E. L. Lozinskii

Inverse reinforcement learning is the problem of inferring a reward function from an optimal policy or demonstrations by an expert. In this work, it is assumed that the reward is expressed as a reward machine whose transitions depend on…

Machine Learning · Computer Science 2025-10-23 Mohamad Louai Shehab , Antoine Aspeel , Necmiye Ozay

Predictive models are fundamental to engineering reliable software systems. However, designing conservative, computable approximations for the behavior of programs (static analyses) remains a difficult and error-prone process for modern…

Programming Languages · Computer Science 2011-05-10 David Van Horn , Matthew Might

Communicating finite-state machines are a fundamental, well-studied model of finite-state processes that communicate via unbounded first-in first-out channels. We show that they are expressively equivalent to existential MSO logic with two…

Logic in Computer Science · Computer Science 2017-09-29 Benedikt Bollig , Marie Fortin , Paul Gastin

Isabelle is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a meta-logic (or `logical framework') in…

Logic in Computer Science · Computer Science 2009-09-25 Lawrence C. Paulson

Here we present a new approach to search for first order invariants (first integrals) of rational second order ordinary differential equations. This method is an alternative to the Darbouxian and symmetry approaches. Our procedure can…

Mathematical Physics · Physics 2018-10-09 J. Avellar , M. S. Cardoso , L. G. S. Duarte , L. A. C. P. da Mota

Cross-modal entity linking refers to the ability to align entities and their attributes across different modalities. While cross-modal entity linking is a fundamental skill needed for real-world applications such as multimodal code…

Computation and Language · Computer Science 2025-06-02 Iñigo Alonso , Gorka Azkune , Ander Salaberria , Jeremy Barnes , Oier Lopez de Lacalle

We describe Imandra, a modern computational logic theorem prover designed to bridge the gap between decision procedures such as SMT, semi-automatic inductive provers of the Boyer-Moore family like ACL2, and interactive proof assistants for…

Logic in Computer Science · Computer Science 2020-04-23 Grant Olney Passmore , Simon Cruanes , Denis Ignatovich , Dave Aitken , Matt Bray , Elijah Kagan , Kostya Kanishev , Ewen Maclean , Nicola Mometto

Tool-using agents that act in the world need to be both useful and safe. Well-calibrated model confidences can be used to weigh the risk versus reward of potential actions, but prior work shows that many models are poorly calibrated.…

Computation and Language · Computer Science 2025-04-30 Nishant Subramani , Jason Eisner , Justin Svegliato , Benjamin Van Durme , Yu Su , Sam Thomson

To comprehensively evaluate the mathematical reasoning capabilities of Large Language Models (LLMs), researchers have introduced abundant mathematical reasoning datasets. However, most existing datasets primarily focus on linear reasoning,…

Computation and Language · Computer Science 2026-02-25 Yuliang Ji , Fuchen Shen , Jian Wu , Qiujie Xie , Yue Zhang

Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the values of some attributes for two tuples, provided that the…

Databases · Computer Science 2010-08-24 Leopoldo Bertossi , Solmaz Kolahi , Laks V. S. Lakshmanan

A second-order face-centred finite volume strategy on general meshes is proposed. The method uses a mixed formulation in which a constant approximation of the unknown is computed on the faces of the mesh. Such information is then used to…

Numerical Analysis · Mathematics 2020-12-01 Matteo Giacomini , Ruben Sevilla

We define Oracle-Type-2-Machine capable of writing infinite oracle queries. In contrast to finite oracle queries, this extends the realm of oracle-computable functions into the discontinuous realm. Our definition is conservative; access to…

Logic in Computer Science · Computer Science 2009-07-21 Arno Pauly

Pattern matching is a fundamental process in almost every scientific domain. The problem involves finding the positions of a given pattern (usually of short length) in a reference stream of data (usually of large length). The matching can…

Data Structures and Algorithms · Computer Science 2022-07-01 Anas Al-okaily , Abdelghani Tbakhi

Prime implicates and prime implicants have proven relevant to a number of areas of artificial intelligence, most notably abductive reasoning and knowledge compilation. The purpose of this paper is to examine how these notions might be…

Logic in Computer Science · Computer Science 2014-01-16 Meghyn Bienvenu

We present a family of logics for reasoning about agents' positions and motion in the plane which have several potential applications in the area of multi-agent systems (MAS), such as multi-agent planning and robotics. The most general…

Artificial Intelligence · Computer Science 2017-02-07 Philippe Balbiani , David Fernández-Duque , Emiliano Lorini

Cross-encoders deliver state-of-the-art ranking effectiveness in information retrieval, but have a high inference cost. This prevents them from being used as first-stage rankers, but also incurs a cost when re-ranking documents. Prior work…

Information Retrieval · Computer Science 2026-03-04 Mathias Vast , Victor Morand , Basile van Cooten , Laure Soulier , Josiane Mothe , Benjamin Piwowarski

Recently, model-based retrieval has emerged as a new paradigm in text retrieval that discards the index in the traditional retrieval model and instead memorizes the candidate corpora using model parameters. This design employs a…

Information Retrieval · Computer Science 2023-05-19 Ruiyang Ren , Wayne Xin Zhao , Jing Liu , Hua Wu , Ji-Rong Wen , Haifeng Wang
‹ Prev 1 3 4 5 6 7 10 Next ›