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
Predicate-Induced Permutation Groups [PDF]
, 2011 Natural languages abound in combinatorial phenomena that are related to the predicate of the sentence and its ability to permute noun phrase arguments.
Matthias Gerner, M. Gerner
core +1 more source
SEDGE: Symbolic Example Data Generation for Dataflow Programs [PDF]
, 2013 Exhaustive, automatic testing of dataflow (esp. map- reduce) programs has emerged as an important challenge. Past work demonstrated effective ways to generate small example data sets that exercise operators in the Pig platform, used to generate Hadoop ...
Kaituo Li +9 more
core +1 more source
On the Inner Product Predicate and a Generalization of Matching Vector Families [PDF]
, 2018 Motivated by cryptographic applications such as predicate encryption, we consider the problem of representing an arbitrary predicate as the inner product predicate on two vectors. Concretely, fix a Boolean function P and some modulus q. We are interested
Wee, Hoeteck +5 more
core +1 more source
First Order Predicate Logic Without Negation is NP-Complete [PDF]
, 1977 Techniques developed in the study of the complexity of finitely presented algebras are used to show that the problem of deciding validity of positive sentences in the language of first order predicate logic with equality is $\leq_{\log}$-complete for ...
Kozen, Dexter
core
Rewrite method for theorem proving in first order theory with equality [PDF]
, 1987 In this paper we extend the term rewriting approach to first order theorem proving, as described in Hsiang & Dershowitz 1983), to the theory of first order predicate calculus with equality.
Jieh Hsiang, Hsiang, Jieh
core +1 more source
Temporal Logic With Predicate Lambda-Abstraction. [PDF]
, 2005 A predicate linear temporal logic LTL = without quantifiers but with predicate -abstraction mechanism and equality is considered. The models of LTL = can be naturally seen as the systems of pebbles (flexible constants) moving over the elements of some ...
Igor Potapov, Alexei Lisitsa
core
Generating minimum transitivity constraints in P-time for deciding Equality Logic [PDF]
, 2008 . In a CAV’05 paper [MS05] we introduced a new decision procedure for Equality Logic: each equality predicate is encoded with a Boolean variable, and then a set of transitivity constraints are added to compensate for the loss of transitivity of equality.
Ofer Strichman +3 more
core +1 more source
The “equal last letter” predicate for words on infinite alphabets and classes of multitape automata
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Choffrut, Serge Grigorieff
openaire +1 more source
Privacy-Preserving Predicate Proof of Attributes with CL-Anonymous Credential [PDF]
, 2020 The anonymous credential system allows users to convince relying parties the possession of a credential released by an issuer. To adhere to the minimal information disclose principle, the anonymous credential facilitates predicate proofs of attributes ...
Nan Guo +3 more
core