Sciweavers

842 search results - page 115 / 169
» Linear logic
Sort
View
ISMIS
2005
Springer
14 years 1 months ago
Normal Forms for Knowledge Compilation
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operate...
Reiner Hähnle, Neil V. Murray, Erik Rosenthal
HIPC
2004
Springer
14 years 1 months ago
A Parallel State Assignment Algorithm for Finite State Machines
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines (FSMs). High performance CAD tools are necessary to...
David A. Bader, Kamesh Madduri
ECIR
2003
Springer
13 years 9 months ago
From Uncertain Inference to Probability of Relevance for Advanced IR Applications
Uncertain inference is a probabilistic generalisation of the logical view on databases, ranking documents according to their probabilities that they logically imply the query. For ...
Henrik Nottelmann, Norbert Fuhr
CONCUR
1999
Springer
14 years 1 days ago
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...
Christel Baier, Joost-Pieter Katoen, Holger Herman...
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
14 years 9 months ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa