Sciweavers

2308 search results - page 161 / 462
» Representing Symbolic Reasoning
Sort
View
ICTAI
2002
IEEE
15 years 11 months ago
Updating a Hybrid Rule Base with New Empirical Source Knowledge
Neurules are a kind of hybrid rules that combine a symbolic (production rules) and a connectionist (adaline unit) representation. Each neurule is represented as an adaline unit. O...
Jim Prentzas, Ioannis Hatzilygeroudis, Athanasios ...
TACAS
2001
Springer
92views Algorithms» more  TACAS 2001»
15 years 11 months ago
Language Containment Checking with Nondeterministic BDDs
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...
Bernd Finkbeiner
CPM
2000
Springer
145views Combinatorics» more  CPM 2000»
15 years 10 months ago
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
Gonzalo Navarro, Jorma Tarhio
CIARP
2007
Springer
15 years 10 months ago
Information Extraction and Classification from Free Text Using a Neural Approach
Many approaches to Information Extraction (IE) have been proposed in literature capable of finding and extract specific facts in relatively unstructured documents. Their applicatio...
Ignazio Gallo, Elisabetta Binaghi
COCOA
2009
Springer
15 years 10 months ago
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
Anna Beletska, Denis Barthou, Wlodzimierz Bielecki...