49 research outputs found

    Chain-Free String Constraints (Technical Report)

    Full text link
    We address the satisfiability problem for string constraints that combine relational constraints represented by transducers, word equations, and string length constraints. This problem is undecidable in general. Therefore, we propose a new decidable fragment of string constraints, called weakly chaining string constraints, for which we show that the satisfiability problem is decidable. This fragment pushes the borders of decidability of string constraints by generalising the existing straight-line as well as the acyclic fragment of the string logic. We have developed a prototype implementation of our new decision procedure, and integrated it into in an existing framework that uses CEGAR with under-approximation of string constraints based on flattening. Our experimental results show the competitiveness and accuracy of the new framework

    Galois theory for analogical classifiers

    Get PDF
    International audienceAnalogical proportions are 4-ary relations that read “A is to B as C is to D”. Recent works have highlighted the fact that such relations can support a specific form of inference, called analogical inference. This inference mechanism was empirically proved to be efficient in several reasoning and classification tasks. In the latter case, it relies on the notion of analogy preservation. In this paper, we explore this relation between formal models of analogy and the corresponding classes of analogy preserving functions, and we establish a Galois theory of analogical classifiers. We illustrate the usefulness of this Galois framework over Boolean domains, and we explicitly determine the closed sets of analogical classifiers, i.e., classifiers that are compatible with the analogical inference, for each pair of Boolean analogies

    Stability of Boolean function classes with respect to clones of linear functions

    Get PDF
    We consider classes of Boolean functions stable under compositions both from the right and from the left with clones. Motivated by the question how many properties of Boolean functions can be defined by means of linear equations, we focus on stability under compositions with the clone of linear idempotent functions. It follows from a result by Sparks that there are countably many such linearly definable classes of Boolean functions. In this paper, we refine this result by completely describing these classes. This work is tightly related with the theory of function minors, stable classes, clonoids, and hereditary classes, topics that have been widely investigated in recent years by several authors including Maurice Pouzet and his coauthors.Comment: 44 page

    On Complete Representations and Minimal Completions in Algebraic Logic, Both Positive and Negative Results

    Get PDF
    Fix a finite ordinal n3n\geq 3 and let α\alpha be an arbitrary ordinal. Let CAn\mathsf{CA}_n denote the class of cylindric algebras of dimension nn and RA\sf RA denote the class of relation algebras. Let PAα(PEAα)\mathbf{PA}_{\alpha}(\mathsf{PEA}_{\alpha}) stand for the class of polyadic (equality) algebras of dimension α\alpha. We reprove that the class CRCAn\mathsf{CRCA}_n of completely representable CAn\mathsf{CA}_ns, and the class CRRA\sf CRRA of completely representable RA\mathsf{RA}s are not elementary, a result of Hirsch and Hodkinson. We extend this result to any variety V\sf V between polyadic algebras of dimension nn and diagonal free CAn\mathsf{CA}_ns. We show that that the class of completely and strongly representable algebras in V\sf V is not elementary either, reproving a result of Bulian and Hodkinson. For relation algebras, we can and will, go further. We show the class CRRA\sf CRRA is not closed under ,ω\equiv_{\infty,\omega}. In contrast, we show that given αω\alpha\geq \omega, and an atomic APEAα\mathfrak{A}\in \mathsf{PEA}_{\alpha}, then for any \(n/p

    Efficient Automata Techniques and Their Applications

    Get PDF
    Tato práce se zabývá vývojem efektivních technik pro konečné automaty a jejich aplikace. Zejména se věnujeme konečným automatům použitých pří detekci útoků v síťovém provozu a automatům v rozhodovacích procedurách a verifikaci. V první části práce navrhujeme techniky přibližné redukce nedeterministických automatů, které snižují spotřebu zdrojů v hardwarově akcelerovaném zkoumání obsahu paketů. Druhá část práce je je věnována automatům v rozhodovacích procedurách, zejména slabé monadické logice druhého řádů k následníků (WSkS) a teorie nad řetězci. Navrhujeme novou rozhodovací proceduru pro WS2S založenou na automatových termech, umožňující efektivně prořezávat stavový prostor. Dále studujeme techniky předzpracování WSkS formulí za účelem snížení velikosti konstruovaných automatů. Automaty jsme také aplikovali v rozhodovací proceduře teorie nad řetězci pro efektivní reprezentaci důkazového stromu. V poslední části práce potom navrhujeme optimalizace rank-based komplementace Buchiho automatů, které snižuje počet generovaných stavů během konstrukce komplementu.This thesis develops efficient techniques for finite automata and their applications. In particular, we focus on finite automata in network intrusion detection and automata in decision procedures and verification. In the first part of the thesis, we propose techniques of approximate reduction of nondeterministic automata decreasing consumption of resources of hardware-accelerated deep packet inspection. The second part is devoted to automata in decision procedures, in particular, to weak monadic second-order logic of k successors (WSkS) and the theory of strings. We propose a novel decision procedure for WS2S based on automata terms allowing one to effectively prune the state space. Further, we study techniques of WSkS formulae preprocessing intended to reduce the sizes of constructed intermediate automata. Moreover, we employ automata in a decision procedure of the theory of strings for efficient handling of the proof graph. The last part of the thesis then proposes optimizations in rank-based Buchi automata complementation reducing the number of generated states during the construction.

    Stability of Boolean function classes with respect to clones of linear functions

    Get PDF
    We consider classes of Boolean functions stable under compositions both from the right and from the left with clones. Motivated by the question how many properties of Boolean functions can be defined by means of linear equations, we focus on stability under compositions with the clone of linear idempotent functions. It follows from a result by Sparks that there are countably many such linearly definable classes of Boolean functions. In this paper, we refine this result by completely describing these classes. This work is tightly related with the theory of function minors, stable classes, clonoids, and hereditary classes, topics that have been widely investigated in recent years by several authors including Maurice Pouzet and his coauthors

    Parameterized analysis of complexity

    Get PDF
    corecore