English
Related papers

Related papers: Calculating Valid Domains for BDD-Based Interactiv…

200 papers

We introduce a novel framework, termed $\lambda$DD, that revisits Binary Decision Diagrams from a purely functional point of view. The framework allows to classify the already existing variants, including the most recent ones like Chain-DD…

Logic in Computer Science · Computer Science 2020-07-23 Joan Thibault , Khalil Ghorbal

In this paper, we explain how some basic facts about valuation can help clarify many questions about divisibility in integral domains.

Commutative Algebra · Mathematics 2020-04-21 Nicholas Phat Nguyen

The generation of planning domains from natural language descriptions remains an open problem even with the advent of large language models and reasoning models. Recent work suggests that while LLMs have the ability to assist with domain…

Artificial Intelligence · Computer Science 2026-04-23 James Oswald , Daniel Obolensky , Volodymyr Varha , Vasilije Dragovic , Kavitha Srinivas , Harsha Kokel , Michael Katz , Shirin Sohrabi

Nowadays many software development frameworks implement Behavior-Driven Development (BDD) as a mean of automating the test of interactive systems under construction. Automated testing helps to simulate user's action on the User Interface…

Human-Computer Interaction · Computer Science 2019-05-27 Thiago Rocha , Jean-Luc Hak , Marco Winckler

In the paper we find effective formulas for the invariant functions, appearing in the theory of several complex variables, of the elementary Reinhardt domains. This gives us the first example of a large family of domains for which the…

Complex Variables · Mathematics 2008-02-03 Peter Pflug , Wlodzimierz Zwonek

We address a fundamental mismatch between the combinations of dynamics that occur in cyber-physical systems and the limited kinds of dynamics supported in analysis. Modern applications combine communication, computation, and control. They…

Logic in Computer Science · Computer Science 2016-12-02 Andre Platzer

In this note, we extend the result of \cite{PoulyG16} about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in…

Computational Complexity · Computer Science 2016-08-02 Amaury Pouly

A dimension allowing in particular to state necessary and sufficient conditions of the Morse-Sard Theorem for real valued functions is introduced.

Geometric Topology · Mathematics 2007-05-23 Azat Ainouline

We introduce a continuous domain for function spaces over topological spaces which are not core-compact. Notable examples of such topological spaces include the real line with the upper limit topology, which is used in solution of initial…

Logic in Computer Science · Computer Science 2024-12-18 Amin Farjudian , Achim Jung

The design of embedded control systems is mainly done with model-based tools such as Matlab/Simulink. Numerical simulation is the central technique of development and verification of such tools. Floating-point arithmetic, that is well-known…

Programming Languages · Computer Science 2015-05-18 Alexandre Chapoutot

In large-scale domain classification, an utterance can be handled by multiple domains with overlapped capabilities. However, only a limited number of ground-truth domains are provided for each training utterance in practice while knowing as…

Computation and Language · Computer Science 2020-03-10 Joo-Kyung Kim , Young-Bum Kim

We explain how to compute in the algebraic closure of a valued field. These computations heavily rely on the \NPAz. They are made in the same spirit as the dynamic algebraic closure of a field. They give a concrete content to the theorem…

Commutative Algebra · Mathematics 2024-08-09 Franz-Viktor Kuhlmann , Henri Lombardi , Hervé Perdry

The majority of traditional classification ru les minimizing the expected probability of error (0-1 loss) are inappropriate if the class probability distributions are ill-defined or impossible to estimate. We argue that in such cases class…

Machine Learning · Statistics 2018-08-14 Robert P. W. Duin , Elzbieta Pekalska

To appear in Theory and Practice of Logic Programming (TPLP). Dynamic systems play a central role in fields such as planning, verification, and databases. Fragmented throughout these fields, we find a multitude of languages to formally…

Logic in Computer Science · Computer Science 2024-06-18 Bart Bogaerts , Joachim Jansen , Maurice Bruynooghe , Broes De Cat , Joost Vennekens , Marc Denecker

A formulation of the exponential matrix solution of the matrix-valued Bratu equation is given, based on the structure of the symmetric domain of type BDI. Moreover, an analog for the symmetric domain of type CI is given.

Mathematical Physics · Physics 2020-05-26 Hiroto Inoue

This paper deals with bounding the error on the estimation of quantities of interest obtained by finite element and domain decomposition methods. The proposed bounds are written in order to separate the two errors involved in the resolution…

Computational Physics · Physics 2015-02-11 Valentine Rey , Pierre Gosselet , Christian Rey

Recent work on LatPlan has shown that it is possible to learn models for domain-independent classical planners from unlabeled image data. Although PDDL models acquired by LatPlan can be solved using standard PDDL planners, the resulting…

Artificial Intelligence · Computer Science 2023-06-21 Yuta Takata , Alex Fukunaga

Domain-driven design (DDD) is a powerful design technique for architecting complex software systems. This paper introduces a prompting framework that automates core DDD activities through structured large language model (LLM) interactions.…

Software Engineering · Computer Science 2026-03-30 Tobias Eisenreich , Husein Jusic , Stefan Wagner

We describe a concept to employ Trusted Computing technology to secure Conditional Access Systems (CAS) for DVB. Central is the embedding of a trusted platform module (TPM) into the set-top-box or residential home gateway. Various…

Cryptography and Security · Computer Science 2007-05-23 Nicolai Kuntze , Andreas U. Schmidt

Transition systems are often used to describe the behaviour of software systems. If viewed as a graph then, at their most basic level, vertices correspond to the states of a program and each edge represents a transition between states via…

Logic in Computer Science · Computer Science 2023-03-20 Diana Costa