Sciweavers

100 search results - page 13 / 20
» Representing First-Order Logic Using Graphs
Sort
View
169
Voted
ENTCS
2008
102views more  ENTCS 2008»
15 years 5 months ago
Encoding Distributed Process Calculi into LMNtal
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...
Kazunori Ueda
KR
2004
Springer
15 years 11 months ago
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
Boris Mailhé, Henri Prade
ILP
2003
Springer
15 years 11 months ago
Mining Model Trees: A Multi-relational Approach
In many data mining tools that support regression tasks, training data are stored in a single table containing both the target field (dependent variable) and the attributes (indepe...
Annalisa Appice, Michelangelo Ceci, Donato Malerba
COSIT
1999
Springer
189views GIS» more  COSIT 1999»
15 years 10 months ago
A Formal Model of the Process of Wayfinding in Built Environments
Previous recent research on human wayfinding has focused primarily on mental representations rather than processes of wayfinding. This paper presents a formal model of some aspect...
Martin Raubal, Michael F. Worboys
201
Voted
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 10 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman