Optimising Sargable Conjunctive Predicate Queries in the Context of Big Data [PDF]
, 2022 With the continued increase in the volume of data, the volume dimension of big data has become a significant factor in estimating query time. When all other factors are held constant, query time increases as the volume of data increases and vice versa ...
Veronica V.N. Akwukwuma, +1 more
core +1 more source
On Irrelevance and Algorithmic Equality in Predicative Type Theory
Logical Methods in Computer Science, 2012 Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To separate static and dynamic code, several static analyses and type systems have been put forward. We consider Pfenning's type theory with irrelevant quantification which is compatible with a type-based
Andreas Abel, Gabriel Scherer
openaire +3 more sources
On elementary extensions in Fuzzy Predicate Logics [PDF]
, 2010 10 páginas.-- Comunicación presentada a la International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU) celebrada en Dortmund (Alemania) del 28 de Junio al 2 de Julio de 2010.Our work is a ...
Francesc Esteva +3 more
core +1 more source
Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter [PDF]
, 2022 We prove that the positive fragment of first-order intuitionistic logic in the language with two variables and a single monadic predicate letter, without constants and equality, is undecidable.
Rybakov, Mikhail, Shkatov, Dmitry
core +2 more sources
Decidable logics combining heap structures and data [PDF]
, 2011 We define a new logic, STRAND, that allows reasoning with heap-manipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) formulas express constraints involving heap structures and the data they contain;
Qiu, Xiaokang +5 more
core +1 more source
Inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification [PDF]
, 2020 We present an inductive inference system for proving validity of formulas in the initial algebra \(T_{\mathcal {E}}\) of an order-sorted equational theory \(\mathcal {E}\) with 17 inference rules, where only 6 of them require user interaction, while the remaining 11 can be automated as simplification rules and can be combined together as a limited, yet
Meseguer, José, Skeirik, Stephen
openaire +1 more source
Order-sorted Equality Enrichments Modulo Axioms [PDF]
, 2011 Built-in equality and inequality predicates based on comparison of canonical forms in algebraic specifications are frequently used because they are handy and efficient.
Gutiérrez, Raúl +7 more
core +1 more source
Definability theorem for the intuitionistic predicate logic with equality [PDF]
Nagoya Mathematical Journal, 1982 Svenonius’ definability theorem and its generalizations to the infinitary logic Lω1ω or to a second order logic with countable conjunctions and disjunctions have been studied by Kochen [1], Motohashi [2], [3] or Harnik and Makkai [4], independently.
openaire +2 more sources
A Unification Free Introduction to Logic Programming [PDF]
, 1993 In this paper, we give a new presentation of the fundamental results of the theory of Logic Programming, which differs from classical introductions in at least two ways: the use of predicate algebras to deal with model theoretical aspects and the ...
Di Meglio, R., Sassone, V.
core
A Finitely Axiomatized Formalization of Predicate Calculus with Equality
Notre Dame Journal of Formal Logic, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources