Results 21 to 30 of about 45,874 (260)
Amortized Communication Complexity of an Equality Predicate [PDF]
, 2013 12 pages, beta ...
openaire +2 more sources
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
, 2018 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 +1 more source
First-order logic learning in artificial neural networks [PDF]
, 2010 Artificial Neural Networks have previously been applied in neuro-symbolic learning to learn ground logic program rules. However, there are few results of learning relations using neuro-symbolic learning.
Broda, K., Garcez, A., Guillame-Bert, M.
core +1 more source
Elementary classes of graphs in a language without equality predicate
Journal of Physics: Conference Series, 2020 Abstract In this paper we describe equivalence classes generated by finite graphs in the graph theory language without equality predicate. These classes coincide with classes of so called hard extensions of graphs.
Vladimir N. Remeslennikov +1 more
openaire +1 more source
Proof-irrelevant model of CC with predicative induction and judgmental equality [PDF]
Logical Methods in Computer Science, 2011 We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's trace encoding which is universally defined for any function type, regardless of being impredicative.
Gyesik Lee, Benjamin Werner
openaire +4 more sources
Introducing Quantified Cuts in Logic with Equality
, 2014 Cut-introduction is a technique for structuring and compressing formal proofs. In this paper we generalize our cut-introduction method for the introduction of quantified lemmas of the form $\forall x.A$ (for quantifier-free $A$) to a method generating ...
Hetzl, Stefan +4 more
core +2 more sources
Scalar and Vectorial mu-calculus with Atoms [PDF]
, 2019 We study an extension of modal $\mu$-calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability becomes undecidable.
Klin, Bartek, Łełyk, Mateusz
core +2 more sources
Renominative logics with extended renomination, equality and predicate complement
Artificial Intelligence, 2019 A new class of program-oriented logical formalisms is investigated – renominative logics with extended renominations, equality predicates, and predicate complement composition. Composition algebras and languages of such logics are described; their semantic properties are investigated.
Nikitchenko M.S. +3 more
openaire +1 more source
Social Network Rumor Diffusion Predication Based on Equal Responsibility Game Model [PDF]
IEEE Access, 2019 Because billions of mobile phones build a bridge between mobile sensor networks and social networks, the content of a rumor is diffused faster than ever. Therefore, rumor diffusion becomes an important issue in those two networks and how to predicate rumor diffusion becomes more important in handling rumors when they cause a little impact at the ...
Dazhen Lin +5 more
openaire +2 more sources