The reduced implicate trie (ri-trie), introduced in (Murray and Rosenthal, 2005), is a target language for knowledge compilation. It has the property that any query can be processed in time linear in the size of the query. In this paper, conjunction and negation are developed as update operations for ri-tries that do not require recompilation. Conjunction has been implemented, and experimental ...

Taking as inspiration the hybrid logic HL(↓), we introduce a new family of logics that we call memory logics. In this article we present in detail two interesting members of this family defining their formal syntax and semantics. We then introduce a proper notion of bisimulation and investigate their expressive power (in comparison with modal and hybrid logics). We will prove that in terms of e...

Historical reconstruction problems of traditional rituals, worldview, language and poetics folklore, folk art require an integrated approach from a modern researcher the ethnos spiritual culture. The latter takes into account achievements related sciences, primarily ethnocultural studies ethnolinguistics, archeology folklore studies, comparative typological ethnology. Using this method, history...

Symbolic model checking has been found extremely efficient in the verification of hardware designs, and has been widely adopted in industry in recent years. While traditional model checkers ([McM93]) used the temporal logics ctl or ltl as their specification language, contemporary industrial languages, have sought ways to make the specification language easier to learn and use. The temporal lan...

In [3], Keisler proves that if Q1 is a nonstandard model of the complete theory Th(Q) of (Q;+;×; 0; 1) and C1 is the algebraic closure of Q1, then (C1; Q1) is elementarily equivalent to (C;Q) where C is the algebraic closure of Q. But if Q r 1 is the real closure of Q1 and Qr the real closure of Q, then it is observed in [1] that (Q r 1; Q1) ≡(Qr ;Q). Victor Harnik asked the following question:...

We propose to describe computations using QFPAbit, a language of quantifier-free linear arithmetic on unbounded integers with bitvector operations. We describe an algorithm that, given a QFPAbit formula with input and output variables denoting integers, generates an efficient function from a sequence of inputs to a sequence of outputs, whenever such function on integers exists. The starting poi...

Paren n is the typical generalization of Dyck language to multiple types parentheses. We generalize its notion balancedness allow parentheses different freely commute. show that balanced regular and [Formula: see text]-regular languages can be characterized by syntactic constraints on expressions and, using shuffle trajectories operator, we define grammars for balanced-by-construction with whic...

Themonotone constraint satisfaction problem (MCSP) is the problem of, given an existentially quantified positive formula, decide whether this formula has a model. This problem is a natural generalization of the constraint satisfaction problem, which can be seen as the problem of determining whether a conjunctive formula has a model. In this paper we study the worst-case time complexity, measure...