Sciweavers

1188 search results - page 19 / 238
» Extended Graph Unification
Sort
View
AAECC
2010
Springer
114views Algorithms» more  AAECC 2010»
13 years 10 months ago
Termination of narrowing via termination of rewriting
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
Naoki Nishida, Germán Vidal
NECO
2008
116views more  NECO 2008»
13 years 9 months ago
A (Somewhat) New Solution to the Variable Binding Problem
To perform automatic, unconscious inference, the human brain must solve the "binding problem" by correctly grouping properties with objects. Temporal binding models like...
Leon Barrett, Jerome Feldman, Liam Mac Dermed
DIAGRAMS
2004
Springer
14 years 3 months ago
Ensuring the Drawability of Extended Euler Diagrams for up to 8 Sets
Abstract. This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1, ..., Xn , n < 9....
Anne Verroust, Marie-Luce Viaud
CSJM
2006
81views more  CSJM 2006»
13 years 10 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
JGT
2010
109views more  JGT 2010»
13 years 4 months ago
Homomorphism-homogeneous graphs
We answer two open questions posed by Cameron and Nesetril concerning homomorphismhomogeneous graphs. In particular we show, by giving a characterization of these graphs, that ext...
Momchil Rusinov, Pascal Schweitzer