相关论文: A Prolog assisted search for new simple Lie algebr…
We present a new free library for Constraint Logic Programming over Finite Domains, included with the Ciao Prolog system. The library is entirely written in Prolog, leveraging on Ciao's module system and code transformation capabilities in…
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD)) with a lazy functional logic programming language which seamlessly embodies finite domain (FD) constraints. This proposal…
CLP(H) is an instantiation of the general constraint logic programming scheme with the constraint domain of hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms,…
We present a CLP(FD)-based constraint solver able to deal with unbounded domains. It is based on constraint propagation, resorting to enumeration if all other methods fail. An important aspect is detecting when enumeration was complete and…
This paper introduces two new algorithms for Lie algebras over finite fields and applies them to the investigate the known simple Lie algebras of dimension at most $20$ over the field $\mathbb{F}_2$ with two elements. The first algorithm is…
A way to construct (conjecturally all) simple finite dimensional modular Lie (super)algebras over algebraically closed fields of characteristic not 2 is offered. In characteristic 2, the method is supposed to give only simple Lie…
Formal reasoning about finite sets and cardinality is an important tool for many applications, including software verification, where very often one needs to reason about the size of a given data structure and not only about what its…
Constraint Logic Programming (CLP) is a logic programming formalism used to solve problems requiring the consideration of constraints, like resource allocation and automated planning and scheduling. It has previously been extended in…
Motivated by the recent progress towards classification of simple finite-dimensional Lie algebras over an algebraically closed field of characteristic $2$, we investigate such $15$-dimensional algebras.
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known…
This paper presents a computational model for the cooperation of constraint domains and an implementation for a particular case of practical importance. The computational model supports declarative programming with lazy and possibly…
Logic programming with tabling and constraints (TCLP, tabled constraint logic programming) has been shown to be more expressive and, in some cases, more efficient than LP, CLP, or LP with tabling. In this paper we provide insights regarding…
This paper proposes the use of Constraint Logic Programming (CLP) to model SQL queries in a data-independent abstract layer by focusing on some semantic properties for signalling possible errors in such queries. First, we define a…
Over an algebraically closed fields, an alternative to the method due to Kostrikin and Shafarevich was recently suggested. It produces all known simple finite dimensional Lie algebras in characteristic p>2. For p=2, we investigate one of…
Slicing is a program analysis technique originally developed for imperative languages. It facilitates understanding of data flow and debugging. This paper discusses slicing of Constraint Logic Programs. Constraint Logic Programming (CLP) is…
We overview the classifications of simple finite-dimensional modular Lie algebras. In characteristic 2, their list is wider than that in other characteristics; e.g., it contains desuperizations of modular analogs of complex simple vectorial…
The paper presents the main characteristics and a preliminary implementation of a novel computational framework named CompLog. Inspired by probabilistic programming systems like ProbLog, CompLog builds upon the inferential mechanisms…
We describe an essential improvement of our recent algorithm for computing cohomology of Lie (super)algebra based on partition of the whole cochain complex into minimal subcomplexes. We replace the arithmetic of rational numbers or integers…
Partial functions are common abstractions in formal specification notations such as Z, B and Alloy. Conversely, executable programming languages usually provide little or no support for them. In this paper we propose to add partial…
Constraint Logic Programming (CLP) is a language scheme for combining two declarative paradigms: constraint solving and logic programming. Concurrent Constraint Programming (CCP) is a declarative model for concurrency where agents interact…