Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard modeling tools. In this discipline, a geometric form is specified by the relations that the components of this form must verify instead of explicitly specifying...

This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...

|This paper presents an eecient method for deriving exact s-expanded symbolic expressions for behavioral modeling of analog circuits. The key idea is to introduce a graph-based representation called multi-root Determinant Decision Diagram (DDD), where each root represents the symbolic coeecient of a particular power of s. By exploiting sharing and sparsity, a huge number of symbolic product ter...

Creative Symbolic Interaction brings together the advantages from the worlds of interactive real-time computing and intelligent, content-level analysis and processing, in order to enhance and humanize man-machine communication. Performers improvising along with Symbolic Interaction systems experiment a unique artistic situation where they interact with musical (and possibly multi-modal) agents ...

Symbolic bisimulations were introduced as a mean to define value-passing process calculi using smaller, possibly finite labelled transition systems, equipped with symbolic actions. Similar ideas have been used for modeling with fewer transitions the input behavior of open and asynchronous π-calculus. In this paper we generalize the symbolic technique and apply the resulting theory to these two ...

Building formal models of the world and using them to plan future action is a central problem in artificial intelligence. In this work, we combine two well-known approaches to this problem, namely, reactive hierarchical task networks (HTNs) and symbolic linear planning. The practical motivation for this hybrid approach was to recover from breakdowns in HTN execution by dynamically invoking symb...

The cognitive modeling community is presently divided between two different approaches to the spread of activation through networks. One school holds that symbolic information must be progagated, the other that numeric weights are used and activation spreads in a more analog manner. In this paper we describe a mechanism which allows the two processes to be merged via the introduction into the s...

The paper presents a network modeling tool called Net-Clause Language (NCL), integrating some connectionist-like and some symbolic processing features in a uniied computational environment. Unlike the other connectionist symbol processing approaches, NCL represents and processes symbols not by implementing them as patterns of activity in a traditional neural network, rather it uses some connect...

We investigate the problem of modeling symbolic sequences of polyphonic music in a completely general piano-roll representation. We introduce a probabilistic model based on distribution estimators conditioned on a recurrent neural network that is able to discover temporal dependencies in high-dimensional sequences. Our approach outperforms many traditional models of polyphonic music on a variet...

Factored Markov Decision Processes (MDP) are a de facto standard for compactly modeling sequential decision making problems with uncertainty. Offline planning based on symbolic operators exploits the factored structure of MDPs, but is memory intensive. We present new memoryefficient symbolic operators for online planning, prove the soundness of the operators, and show convergence of the corresp...