Sciweavers

7839 search results - page 1201 / 1568
» What's there and what's not
Sort
View
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
15 years 1 months ago
New Bounds for Codes Identifying Vertices in Graphs
Let G = (V, E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v V , the neighbouring set N(v, C) is the set of vertices of C at d...
Gérard D. Cohen, Iiro S. Honkala, Antoine L...
JIIS
2002
99views more  JIIS 2002»
15 years 1 months ago
Efficient Management of Persistent Knowledge
Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memo...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...
JAIR
1998
163views more  JAIR 1998»
15 years 1 months ago
A Temporal Description Logic for Reasoning about Actions and Plans
A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true whil...
Alessandro Artale, Enrico Franconi
JAIR
1998
97views more  JAIR 1998»
15 years 1 months ago
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
It is common to view programs as a combination of logic and control: the logic part de nes what the program must do, the control part how to do it. The Logic Programming paradigm ...
Oleg Ledeniov, Shaul Markovitch
JOLLI
2002
74views more  JOLLI 2002»
15 years 1 months ago
Referent Systems and Relational Grammar
Abstract. Relational Grammar (RG) was introduced in the 70's as a theory of grammatical relations and relation change, for example, passivization, dative shift, and raising. F...
Marcus Kracht
« Prev « First page 1201 / 1568 Last » Next »