The following pages link to Natasha Alechina (Q208223):
Displayed 50 items.
- The virtues of idleness: a decidable fragment of resource agent logic (Q514142) (← links)
- Reasoning about plan revision in BDI agent programs (Q655407) (← links)
- Belief ascription under bounded resources (Q987466) (← links)
- A logic of situated resource-bounded agents (Q1006513) (← links)
- Preference-based belief revision for rule-based agents (Q1024129) (← links)
- Verifying time, memory and communication bounds in systems of reasoning agents (Q1036066) (← links)
- Functional dependencies between variables (Q1595915) (← links)
- (Q1623282) (redirect page) (← links)
- On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic (Q1909605) (← links)
- Logics with group announcements and distributed knowledge: completeness and expressive power (Q2155204) (← links)
- A logic for reasoning about knowledge of unawareness (Q2258809) (← links)
- Group announcement logic with distributed knowledge (Q2291230) (← links)
- Public group announcements and trust in doxastic logic (Q2291238) (← links)
- Model-checking for resource-bounded ATL with production and consumption of resources (Q2361350) (← links)
- A general method for proving decidability of intuitionistic modal logics (Q2506825) (← links)
- Qualitative Spatial Logics for Buffered Geometries (Q2818239) (← links)
- Logic and Agent Programming Languages (Q2849419) (← links)
- Minimal Preference Change (Q2859090) (← links)
- Fair Allocation of Group Tasks According to Social Norms (Q2921955) (← links)
- (Q2996156) (← links)
- Reasoning about Joint Action and Coalitional Ability in K n with Intersection (Q3092300) (← links)
- Logic for coalitions with bounded resources (Q3103974) (← links)
- Model checking for coalition announcement logic (Q3119277) (← links)
- Fair decomposition of group obligations (Q3133187) (← links)
- Verifying Systems of Resource-Bounded Agents (Q3188235) (← links)
- (Q3384067) (← links)
- Bounded-Resource Reasoning as (Strong or Classical) Planning (Q3393381) (← links)
- Verifying Dribble Agents (Q3402253) (← links)
- The Dynamics of Syntactic Knowledge (Q3437259) (← links)
- (Q3509043) (← links)
- Verifying Time and Communication Costs of Rule-Based Reasoners (Q3614874) (← links)
- Reasoning about Other Agents’ Beliefs under Bounded Resources (Q3644774) (← links)
- Expressing Properties of Coalitional Ability under Resource Bounds (Q3655213) (← links)
- (Q4362725) (← links)
- (Q4394916) (← links)
- Reachability logic: an efficient fragment of transitive closure logic (Q4487265) (← links)
- Incentive-Compatible Mechanisms for Norm Monitoring in Open Multi-Agent Systems (Q4580270) (← links)
- Modal logics for reasoning about infinite unions and intersections of binary relations (Q4583172) (← links)
- (Q4583959) (← links)
- Alternating-time temporal logic with resource bounds (Q4612421) (← links)
- Intuitionistic Modal Logic: A 15-year retrospective (Q4612427) (← links)
- Interpolation for a sequent calculus of generalized quantifiers (Q4645224) (← links)
- (Q4785506) (← links)
- A Modal Perspective on Path Constraints (Q4812322) (← links)
- Correspondence and Completeness for Generalized Quantifiers (Q4842271) (← links)
- (Q4993611) (← links)
- State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems (Q5049036) (← links)
- (Q5157010) (← links)
- Embedding Coalition Logic in the Minimal Normal Multimodal Logic with Intersection (Q5213651) (← links)
- Coalition logic with individual, distributed and common knowledge1 (Q5215820) (← links)