Sciweavers

1032 search results - page 102 / 207
» Extended Computation Tree Logic
Sort
View
LOGCOM
2007
59views more  LOGCOM 2007»
14 years 9 months ago
Forgetting Literals with Varying Propositional Symbols
Recently, the old logical notion of forgetting propositional symbols (or reducing the logical vocabulary) has been generalized to a new notion: forgetting literals. The aim was to...
Yves Moinard
CISIS
2008
IEEE
15 years 4 months ago
Inferring the Function of Genes from Synthetic Lethal Mutations
—Techniques for detecting synthetic lethal mutations in double gene deletion experiments are emerging as powerful tool for analysing genes in parallel or overlapping pathways wit...
Oliver Ray, Christopher H. Bryant
ATAL
2006
Springer
15 years 1 months ago
Symbolic negotiation revisited
In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
Peep Küngas, Mihhail Matskin
CPM
2004
Springer
109views Combinatorics» more  CPM 2004»
15 years 3 months ago
Approximate Labelled Subtree Homeomorphism
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal ...
DEXA
2003
Springer
108views Database» more  DEXA 2003»
15 years 3 months ago
Repairing Inconsistent Merged XML Data
XML is rapidly becoming one of the most adopted standard for information representation and interchange over the Internet. With the proliferation of mobile devices of communication...
Wilfred Ng