The SCEAS System
| |||||||

## Search the dblp DataBase
Natasha Alechina:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Alexandre Albore, Natasha Alechina, Piergiorgio Bertoli, Chiara Ghidini, Brian Logan, Luciano Serafini
**Model-Checking Memory Requirements of Resource-Bounded Reasoners.**[Citation Graph (0, 0)][DBLP] AAAI, 2006, pp:- [Conf] - Brian Logan, Natasha Alechina
**A* with Bounded Costs.**[Citation Graph (0, 0)][DBLP] AAAI/IAAI, 1998, pp:444-449 [Conf] - Natasha Alechina, Dmitry Shkatov
**Logics with an existential modality.**[Citation Graph (0, 0)][DBLP] Advances in Modal Logic, 2006, pp:31-48 [Conf] - Natasha Alechina, Rafael H. Bordini, Jomi Fred Hübner, Mark Jago, Brian Logan
**Belief revision for AgentSpeak agents.**[Citation Graph (0, 0)][DBLP] AAMAS, 2006, pp:1288-1290 [Conf] - Natasha Alechina, Mark Jago, Piergiorgio Bertoli, Brian Logan, Chiara Ghidini, Luciano Serafini
**Verifying space and time requirements for resource-bounded agents.**[Citation Graph (0, 0)][DBLP] AAMAS, 2006, pp:217-219 [Conf] - Natasha Alechina, Brian Logan
**Ascribing beliefs to resource bounded agents.**[Citation Graph (0, 0)][DBLP] AAMAS, 2002, pp:881-888 [Conf] - Natasha Alechina, Brian Logan, Mark Whitsey
**A Complete and Decidable Logic for Resource-Bounded Agents.**[Citation Graph (0, 0)][DBLP] AAMAS, 2004, pp:606-613 [Conf] - Natasha Alechina, Yuri Gurevich
**Syntax vs. Semantics on Finite Structures.**[Citation Graph (0, 0)][DBLP] Structures in Logic and Computer Science, 1997, pp:14-33 [Conf] - Natasha Alechina, Maarten de Rijke
**Describing and Quering Semistructured Data: Some Expressiveness Results.**[Citation Graph (0, 0)][DBLP] BNCOD, 1998, pp:167-168 [Conf] - Graham Mackenzie, Natasha Alechina
**Classifying Sketches of Animals Using an Agent-Based System.**[Citation Graph (0, 0)][DBLP] CAIP, 2003, pp:521-529 [Conf] - Natasha Alechina, Michael Mendler, Valeria de Paiva, Eike Ritter
**Categorical and Kripke Semantics for Constructive S4 Modal Logic.**[Citation Graph (0, 0)][DBLP] CSL, 2001, pp:292-307 [Conf] - Natasha Alechina, Mark Jago, Brian Logan
**Resource-Bounded Belief Revision and Contraction.**[Citation Graph (0, 0)][DBLP] DALT, 2005, pp:141-154 [Conf] - Natasha Alechina, Rafael H. Bordini, Jomi Fred Hübner, Mark Jago, Brian Logan
**Automating Belief Revision for AgentSpeak.**[Citation Graph (0, 0)][DBLP] DALT, 2006, pp:61-77 [Conf] - Natasha Alechina
**(Modal) Logics for Semistructed Data.**[Citation Graph (0, 0)][DBLP] Description Logics, 1999, pp:- [Conf] - Thomas Ågotnes, Natasha Alechina
**Knowing Minimum/Maximum n Formulae.**[Citation Graph (0, 0)][DBLP] ECAI, 2006, pp:317-321 [Conf] - Natasha Alechina, Mark Jago, Brian Logan
**Modal Logics for Communicating Rule-Based Agents.**[Citation Graph (0, 0)][DBLP] ECAI, 2006, pp:322-326 [Conf] - Natasha Alechina
**For All Typical.**[Citation Graph (0, 0)][DBLP] ECSQARU, 1995, pp:1-8 [Conf] - Natasha Alechina, Brian Logan
**Verifying Bounds on Deliberation Time in Multi-Agent Systems.**[Citation Graph (0, 0)][DBLP] EUMAS, 2005, pp:25-34 [Conf] - Natasha Alechina, Brian Logan, Mark Whitsey
**Modelling Communicating Agents in Timed Reasoning Logics.**[Citation Graph (0, 0)][DBLP] JELIA, 2004, pp:95-107 [Conf] - Thomas Ågotnes, Natasha Alechina
**Semantics for Dynamic Syntactic Epistemic Logics.**[Citation Graph (0, 0)][DBLP] KR, 2006, pp:411-419 [Conf] - Natasha Alechina, Stéphane Demri, Maarten de Rijke
**Path Constraints from a Modal Logic Point of View.**[Citation Graph (0, 0)][DBLP] KRDB, 2001, pp:- [Conf] - Natasha Alechina, Brian Logan
**Logical Omniscience and the Cost of Deliberation.**[Citation Graph (0, 0)][DBLP] LPAR, 2001, pp:100-109 [Conf] - Natasha Alechina
**Interpolation for a Sequent Calculus of Generalized Quantifiers.**[Citation Graph (0, 0)][DBLP] TABLEAUX, 1996, pp:36-47 [Conf] - Natasha Alechina, Brian Logan
**State Space Search with Prioritised Soft Constraints.**[Citation Graph (0, 0)][DBLP] Appl. Intell., 2001, v:14, n:3, pp:263-272 [Journal] - Natasha Alechina, Neil Immerman
**Reachability Logic: An Efficient Fragment of Transitive Closure Logic.**[Citation Graph (0, 0)][DBLP] Logic Journal of the IGPL, 2000, v:8, n:3, pp:- [Journal] - Natasha Alechina, Dmitry Shkatov
**A general method for proving decidability of intuitionistic modal logics.**[Citation Graph (0, 0)][DBLP] J. Applied Logic, 2006, v:4, n:3, pp:219-230 [Journal] - Natasha Alechina
**Editorial.**[Citation Graph (0, 0)][DBLP] Journal of Logic, Language and Information, 2005, v:14, n:3, pp:261-262 [Journal] - Natasha Alechina
**On a Decidable Generalized Quantifier Logic Corresponding to a Decidable Fragment of First-Order Logic.**[Citation Graph (0, 0)][DBLP] Journal of Logic, Language and Information, 1995, v:4, n:3, pp:177-189 [Journal] - Natasha Alechina, Michiel van Lambalgen
**Generalized Quantification as Substructural Logic.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1996, v:61, n:3, pp:1006-1044 [Journal] - Natasha Alechina, Stéphane Demri, Maarten de Rijke
**A Modal Perspective on Path Constraints.**[Citation Graph (0, 0)][DBLP] J. Log. Comput., 2003, v:13, n:6, pp:939-956 [Journal] - Natasha Alechina
**Functional Dependencies between Variables.**[Citation Graph (0, 0)][DBLP] Studia Logica, 2000, v:66, n:2, pp:273-283 [Journal] - Natasha Alechina, Mehdi Dastani, Brian Logan, John-Jules Ch. Meyer
**A Logic of Agent Programs.**[Citation Graph (0, 0)][DBLP] AAAI, 2007, pp:795-800 [Conf] - Natasha Alechina, Piergiorgio Bertoli, Chiara Ghidini, Mark Jago, Brian Logan, Luciano Serafini
**Verifying Space and Time Requirements for Resource-Bounded Agents.**[Citation Graph (0, 0)][DBLP] MoChArt, 2006, pp:19-34 [Conf] - Thomas Ågotnes, Natasha Alechina
**The Dynamics of Syntactic Knowledge.**[Citation Graph (0, 0)][DBLP] J. Log. Comput., 2007, v:17, n:1, pp:83-116 [Journal] **Verifying time, memory and communication bounds in systems of reasoning agents.**[Citation Graph (, )][DBLP]**Reasoning about agent execution strategies.**[Citation Graph (, )][DBLP]**Resource-bounded alternating-time temporal logic.**[Citation Graph (, )][DBLP]**Bounded-Resource Reasoning as (Strong or Classical) Planning.**[Citation Graph (, )][DBLP]**Verifying Dribble Agents.**[Citation Graph (, )][DBLP]**A Logic for Coalitions with Bounded Resources.**[Citation Graph (, )][DBLP]**Reasoning about Agent Deliberation.**[Citation Graph (, )][DBLP]**Verifying Resource Requirements for Distributed Rule-Based Systems.**[Citation Graph (, )][DBLP]**Full and relative awareness: a decidable logic for reasoning about knowledge of unawareness.**[Citation Graph (, )][DBLP]**Verifying Time and Communication Costs of Rule-Based Reasoners.**[Citation Graph (, )][DBLP]**The ARTS Real-Time Agent Architecture.**[Citation Graph (, )][DBLP]**Expressing Properties of Coalitional Ability under Resource Bounds.**[Citation Graph (, )][DBLP]**Reasoning about Other Agents' Beliefs under Bounded Resources.**[Citation Graph (, )][DBLP]**The ARTS Real-Time Agent Architecture.**[Citation Graph (, )][DBLP]
Search in 0.113secs, Finished in 0.114secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |