Searching for authors named "Anil Nerode" – sorted by Relevance.
11 documents found, showing 1 through 10.
Next 10 →
-
Effective dimension of points visited by Brownian motion
- … of Mathematics University of Hawai‘i at Mānoa Honolulu, HI 96822 Anil Nerode Department of Mathematics Cornell…
- Add To MetaCart
-
Logics for Hybrid Systems
- …Logics for Hybrid Systems J. M. DAVOREN, MEMBER, IEEE, AND ANIL NERODE, MEMBER, IEEE Invited Paper…
- Cited by 76 (7 self) – Add To MetaCart
-
Experimental Evaluation of Loss Perception in Continuous Media
- … evaluation of loss perception in continuous media ⋆ Duminda Wijesekera 1 , Jaideep Srivastava 1 , Anil Nerode…
- Cited by 9 (0 self) – Add To MetaCart
-
Computing Definite Logic Programs by Partial Instantiation
- … Computing Definite Logic Programs by Partial Instantiation 3 Vadim Kagan y Anil Nerode z V…
- Cited by 6 (0 self) – Add To MetaCart
-
Partial Automata and Finitely Generated Congruences: An Extension of Nerode's Theorem
- …@(email omitted); For Anil Nerode, on the occasion of his 60 th birthday June 4, 1992 Abstract Let T \Sigma be the set…
- Cited by 4 (0 self) – Add To MetaCart
-
Non-Ground Stable and Well-Founded Semantics
- … Non-Ground Stable and Well-Founded Semantics 3 Georg Gottlob y Sherry Marcus z Anil Nerode x…
- Cited by 1 (0 self) – Add To MetaCart
-
Logical Constraints and Logic Programming
- …Logical Constraints and Logic Programming 1 V. Wiktor Marek, 2 Anil Nerode, 3 and Jeffrey B…
- Cited by 5 (3 self) – Add To MetaCart
-
The Stable Models of a Predicate Logic Program
- … University of Kentucky Lexington, KY 40506--0027, USA Anil Nerode Mathematical Sciences Institute Cornell…
- Cited by 30 (10 self) – Add To MetaCart
-
Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases
- … Anil Nerode z Raymond T. Ng x V.S. Subrahmanian -- Abstract Though the declarative semantics…
- Cited by 45 (8 self) – Add To MetaCart
-
Computing Circumscriptive Databases, Part I: Theory and Algorithms
- …this paper, we have adopted the view of model-theoretic circumscription (cf. Etherington [15], Horty [22]) which is quite well-known in the literature [40] and we restrict interest only to Herbrand pre-interpretations. Notwithstanding the computational complexity of circumscription, algorithms still…
- Cited by 2 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
