Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Vandevelde, Simon"'
Several paradigms for declarative problem solving start from a specification in a high-level language, which is then transformed to a low-level language, such as SAT or SMT. Often, this transformation includes a "grounding" step to remove first-order
Externí odkaz:
http://arxiv.org/abs/2408.07980
Substantial efforts have been made in developing various Decision Modeling formalisms, both from industry and academia. A challenging problem is that of expressing decision knowledge in the context of incomplete knowledge. In such contexts, decisions
Externí odkaz:
http://arxiv.org/abs/2312.11186
As the popularity of adhesive joints in industry increases, so does the need for tools to support the process of selecting a suitable adhesive. While some such tools already exist, they are either too limited in scope, or offer too little flexibility
Externí odkaz:
http://arxiv.org/abs/2311.06302
Industry abounds with interactive configuration problems, i.e., constraint solving problems interactively solved by persons with the assistance of a computer. The computer program, called a configurator, needs to perform a variety of reasoning tasks
Externí odkaz:
http://arxiv.org/abs/2202.00343
Autor:
Vandevelde, Simon, Vennekens, Joost
This paper presents a probabilistic extension of the well-known cellular automaton, Game of Life. In Game of Life, cells are placed in a grid and then watched as they evolve throughout subsequent generations, as dictated by the rules of the game. In
Externí odkaz:
http://arxiv.org/abs/2201.09521
Knowledge-based AI typically depends on a knowledge engineer to construct a formal model of domain knowledge -- but what if domain experts could do this themselves? This paper describes an extension to the Decision Model and Notation (DMN) standard,
Externí odkaz:
http://arxiv.org/abs/2110.02610
We present Probabilistic Decision Model and Notation (pDMN), a probabilistic extension of Decision Model and Notation (DMN). DMN is a modeling notation for deterministic decision logic, which intends to be user-friendly and low in complexity. pDMN ex
Externí odkaz:
http://arxiv.org/abs/2110.01909
This paper describes an extension to the DMN standard, called cDMN. It aims to enlarge the expressivity of DMN in order to solve more complex problems, while retaining DMN's goal of being readable by domain experts. We test cDMN by solving the most c
Externí odkaz:
http://arxiv.org/abs/2005.09998
Publikováno v:
In Procedia CIRP 2022 109:161-166
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.