Results 1 - 10 of 40

Predicate Logic Unplugged

by Johan Bos - In Proceedings of the 10th Amsterdam Colloquium , 1995
"... this paper we describe the syntax and semantics of a description language for underspecified semantic representations. This concept is discussed in general and in particular applied to Predicate Logic and Discourse Representation Theory. The reason for exploring underspecified representations as sui ..."
Abstract - Cited by 156 (7 self) - Add to MetaCart
as suitable semantic representations for natural language expressions emerges directly from practical natural language processing applications. The so-called Combinatorial Explosion Puzzle, a well known problem in this area, can succesfully be tackled by using underspecified representations. The source

Johan Bos

by Universitat Des, Johan Bos, Johan Bos, Gehort Zum Antragsabschnitt - In Proceedings of the 10th Amsterdam Colloquium , 1996
"... this paper we describe the syntax and semantics of a description language for underspecified semantic representations. This concept is discussed in general and in particular applied to Predicate Logic and Discourse Representation Theory. The reason for exploring underspecified representations as sui ..."
Abstract - Add to MetaCart
as suitable semantic representations for natural language expressions emerges directly from practical natural language processing applications. The so-called Combinatorial Explosion Puzzle, a well known problem in this area, can succesfully be tackled by using underspecified representations. The source

Optimizations of the Combinatorial Neural Model

by Fábio Ghignatti Beckenkamp, Miguel Artur Feldens, Wolfgang Pree
"... In this paper we present significant optimizations of the so-called Combinatorial Neural Model (CNM). CNM is a hybrid (neural/symbolic) model that has been used in areas such as expert system development and data mining. The paper first explains the CNM architecture and goes on to present CNM optimi ..."
Abstract - Add to MetaCart
In this paper we present significant optimizations of the so-called Combinatorial Neural Model (CNM). CNM is a hybrid (neural/symbolic) model that has been used in areas such as expert system development and data mining. The paper first explains the CNM architecture and goes on to present CNM

Abstract Optimizations of the Combinatorial Neural Model

by Fábio Ghignatti Beckenkamp, Miguel Artur Feldens, Wolfgang Pree
"... In this paper we present significant optimizations of the so-called Combinatorial Neural Model (CNM). CNM is a hybrid (neural/symbolic) model that has been used in areas such as expert system development and data mining. The paper first explains the CNM architecture and goes on to present CNM optimi ..."
Abstract - Add to MetaCart
In this paper we present significant optimizations of the so-called Combinatorial Neural Model (CNM). CNM is a hybrid (neural/symbolic) model that has been used in areas such as expert system development and data mining. The paper first explains the CNM architecture and goes on to present CNM

JOURNAL OF COMBINATORIAL THEORY (R) 16, 86-96 (1974) Graph Puzzles, Homotopy, and the Alternating Group”

by Richard M. Wilsox, Communicated Alan, J. Hoffman , 1973
"... The so-called 15-puzzle may be generalized to a puzzle based on an arbitrary graph. We consider labelings or colorings of the vertices and the operation of switching one distinguished label with a label on an adjacent vertex. Starting from a given labeling, iterations of this operation allow one to ..."
Abstract - Add to MetaCart
The so-called 15-puzzle may be generalized to a puzzle based on an arbitrary graph. We consider labelings or colorings of the vertices and the operation of switching one distinguished label with a label on an adjacent vertex. Starting from a given labeling, iterations of this operation allow one

Semantic Ambiguity and Perceived Ambiguity

by Massimo Poesio - Semantic Ambiguity and Underspecification , 1994
"... I explore some of the issues that arise when trying to establish a connection between the underspecification hypothesis pursued in the NLP literature and work on ambiguity in semantics and in the psychological literature. A theory of underspecification is developed `from the first principles&apo ..."
Abstract - Cited by 41 (9 self) - Add to MetaCart
are discussed. 1 The Combinatorial Explosion Puzzle The alternative syntactic readings of a sen...

Pushing the Limits: New Developments in Single-Agent Search

by Andreas Junghanns, Andreas Junghanns, Meinen Eltern , 1999
"... Search is one of the fundamental methods in artificial intelligence (AI). It is at the core of many successes of AI that range from beating world champions in non-trivial games to building master schedules for large corporations. However, the applications of today and tomorrow require more than exha ..."
Abstract - Cited by 32 (4 self) - Add to MetaCart
exhaustive, brute-force search, because these application domains have become increasingly complex. Traditional methods fail to break the complexity barrier caused by the combinatorial explosion that characterizes these large, real-world domains. This thesis enhances our understanding of single-agent search

A Quantitative Study of Pure Parallel Processes∗

by Olivier Bodini, Antoine Genitrini, Frédéric Peschanski , 2014
"... In this paper, we study the interleaving – or pure merge – operator that most often characterizes parallelism in concurrency theory. This operator is a principal cause of the so-called combinatorial explosion that makes very hard- at least from the point of view of computational complexity- the anal ..."
Abstract - Add to MetaCart
In this paper, we study the interleaving – or pure merge – operator that most often characterizes parallelism in concurrency theory. This operator is a principal cause of the so-called combinatorial explosion that makes very hard- at least from the point of view of computational complexity

Time Petri Nets Analysis with TINA

by unknown authors
"... Abstract — Beside the usual graphic editing and simulation facilities, the software tool Tina may build a number of state space abstractions for Petri nets or Time Petri nets, preserving certain classes of properties. For Petri nets, these abstractions help preventing combinatorial explosion and rel ..."
Abstract - Add to MetaCart
and rely on so-called partial order techniques such as covering steps and/or persistent sets. For Time Petri nets, that have in general infinite state spaces, they provide finite representation of their behavior, in terms of state class graphs.

Using Embryonic Stages to increase the evolvability of development

by Diego Federici - In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2004) Workshop Program , 2004
"... Indirect encoding methods are aimed at the reduction of the combinatorial explosion of search spaces, therefore increasing the evolvability of large phenotypes. These so called Artificial Embryogeny systems have so far shown increased scalability for problems involving solutions of low complexity. T ..."
Abstract - Cited by 13 (2 self) - Add to MetaCart
Indirect encoding methods are aimed at the reduction of the combinatorial explosion of search spaces, therefore increasing the evolvability of large phenotypes. These so called Artificial Embryogeny systems have so far shown increased scalability for problems involving solutions of low complexity
Results 1 - 10 of 40