Searching for authors named "Natasha Alechina" – sorted by Relevance.
-
COURIER FONT SQL Data Definition
- SQL Data Definition Database Systems Lecture 5 Natasha Alechina • Originally ‘Sequel’ - Structured
- Add To MetaCart
-
Fast Stream - Efficient Fragments of Transitive Closure Logic
- FAST STREAM Ecient Fragments of Transitive Closure Logic Natasha Alechina Part 2: Description
- Add To MetaCart
-
2007): Full and relative awareness: A decidable logic for reasoning about knowledge of unawareness, mimeo
- , philosophy, and multi-agent systems. One of Natasha Alechina University of Nottingham UK nza
- Cited by 1 (0 self) – Add To MetaCart
-
Logic with Probabilistic Operators
- Logic with Probabilistic Operators Natasha Alechina Department of Mathematics and Computer Science
- Cited by 1 (0 self) – Add To MetaCart
-
On One Decidable Generalized Quantifier Logic Corresponding to a Decidable Fragment of First-Order Logic
- -order logic Natasha Alechina November 10, 1994 Abstract Van Lambalgen (1990) proposed a translation from a
- Cited by 2 (1 self) – Add To MetaCart
-
For All Typical
- For all typical Natasha Alechina FWI, University of Amsterdam Pl. Muidergracht 24, 1018 TV
- Cited by 1 (0 self) – Add To MetaCart
-
Semi-Structured Information: A Modal Logic Approach
- Semi-structured information: a modal logic approach Natasha Alechina August 29, 1997 Abstract
- Cited by 1 (0 self) – Add To MetaCart
-
Ascribing Beliefs to Resource Bounded Agents
- ABSTRACT Ascribing beliefs to resource bounded agents Natasha Alechina School of Computer Science
- Cited by 9 (2 self) – Add To MetaCart
-
A* with Bounded Costs
- A with Bounded Costs Brian Logan and Natasha Alechina School of Computer Science, University
- Cited by 15 (5 self) – Add To MetaCart
-
Reachability Logic: An Efficient Fragment of Transitive Closure Logic
- Reachability Logic: An Ecient Fragment of Transitive Closure Logic NATASHA ALECHINA, School
- Cited by 10 (0 self) – Add To MetaCart

