Sciweavers

120 search results - page 14 / 24
» Covered Clause Elimination
Sort
View
APAL
2000
90views more  APAL 2000»
14 years 9 months ago
The definable multiplicity property and generic automorphisms
Let T be a strongly minimal theory with quantifier elimination. We show that the class of existentially closed models of T {" is an automorphism"} is an elementary clas...
Hirotaka Kikyo, Anand Pillay
AGENTS
2001
Springer
15 years 2 months ago
Terrain coverage with ant robots: a simulation study
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...
Sven Koenig, Yaxin Liu
IGARSS
2009
14 years 7 months ago
Developing a Neural-network-based "BRDF" Tool for the UAE Coastal and Inland Zones
The radiation reflected by any observed surface is highly dependent on both sun illumination and satellite observation angles. These two angles are also described, respectively, a...
Ali Al Suwaidi, Adnan Al Rais, Hosni Ghedira, Maro...
EACL
1989
ACL Anthology
14 years 10 months ago
A logical treatment of semi-free word order and bounded discontinuous constituency
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...
Mike Reape
CORR
1998
Springer
126views Education» more  CORR 1998»
14 years 9 months ago
Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
Victor W. Marek, Miroslaw Truszczynski