17 found
Order:
  1.  87
    Verifying Time, Memory and Communication Bounds in Systems of Reasoning Agents.Natasha Alechina, Brian Logan, Hoang Nga Nguyen & Abdur Rakib - 2009 - Synthese 169 (2):385-403.
    We present a framework for verifying systems composed of heterogeneous reasoning agents, in which each agent may have differing knowledge and inferential capabilities, and where the resources each agent is prepared to commit to a goal (time, memory and communication bandwidth) are bounded. The framework allows us to investigate, for example, whether a goal can be achieved if a particular agent, perhaps possessing key information or inferential capabilities, is unable (or unwilling) to contribute more than a given portion of its (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  2.  47
    Belief Ascription Under Bounded Resources.Natasha Alechina & Brian Logan - 2010 - Synthese 173 (2):179 - 197.
    There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, namely, on the ascription of beliefs and inference rules by the agents to each other. We present a formal model of a system of bounded reasoners which reason about each other’s beliefs, and investigate the problem of belief ascription in a resource-bounded setting. We show that for agents whose computational resources and memory are bounded, (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  3.  4
    A General Method for Proving Decidability of Intuitionistic Modal Logics.Natasha Alechina & Dmitry Shkatov - 2006 - Journal of Applied Logic 4 (3):219-230.
  4.  33
    On a Decidable Generalized Quantifier Logic Corresponding to a Decidable Fragment of First-Order Logic.Natasha Alechina - 1995 - Journal of Logic, Language and Information 4 (3):177-189.
    Van Lambalgen (1990) proposed a translation from a language containing a generalized quantifierQ into a first-order language enriched with a family of predicatesR i, for every arityi (or an infinitary predicateR) which takesQxg(x, y1,..., yn) to x(R(x, y1,..., y1) (x,y1,...,yn)) (y 1,...,yn are precisely the free variables ofQx). The logic ofQ (without ordinary quantifiers) corresponds therefore to the fragment of first-order logic which contains only specially restricted quantification. We prove that it is decidable using the method of analytic tableaux. Related (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  5.  7
    Correspondence and Completeness for Generalized Quantifiers.Natasha Alechina & Michiel van Lambalgen - 1995 - Logic Journal of the IGPL 3 (2-3):167-190.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  6.  8
    Generalized Quantification as Substructural Logic.Natasha Alechina & Michiel van Lambalgen - 1996 - Journal of Symbolic Logic 61 (3):1006 - 1044.
    We show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Herbrand approach to ordinary first order proof theory. Typical of the Herbrand approach, as compared to plain sequent calculus, is increased control over relations of dependence between variables. In the case of generalized quantifiers, explicit attention to relations of dependence becomes indispensible for setting up proof systems. It is shown that this can be done by turning variables into structured objects, governed by various types of (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  7.  85
    Preference-Based Belief Revision for Rule-Based Agents.Natasha Alechina, Mark Jago & Brian Logan - 2008 - Synthese 165 (2):159-177.
    Agents which perform inferences on the basis of unreliable information need an ability to revise their beliefs if they discover an inconsistency. Such a belief revision algorithm ideally should be rational, should respect any preference ordering over the agent’s beliefs (removing less preferred beliefs where possible) and should be fast. However, while standard approaches to rational belief revision for classical reasoners allow preferences to be taken into account, they typically have quite high complexity. In this paper, we consider belief revision (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  8.  38
    Generalized Quantification as Substructural Logic.Natasha Alechina & Michiel van Lambalgen - 1996 - Journal of Symbolic Logic 61 (3):1006-1044.
    We show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Herbrand approach to ordinary first order proof theory. Typical of the Herbrand approach, as compared to plain sequent calculus, is increased control over relations of dependence between variables. In the case of generalized quantifiers, explicit attention to relations of dependence becomes indispensible for setting up proof systems. It is shown that this can be done by turning variables into structured objects, governed by various types of (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  9. Modelling Communicating Agents in Timed Reasoning Logics.Brian Logan, Mark Jago & Natasha Alechina - 2006 - In U. Endriss & M. Baldoni (eds.), Declarative Agent Languages and Technologies 4. Springer.
    Practical reasoners are resource-bounded—in particular they require time to derive consequences of their knowledge. Building on the Timed Reasoning Logics (TRL) framework introduced in [1], we show how to represent the time required by an agent to reach a given conclusion. TRL allows us to model the kinds of rule application and conflict resolution strategies commonly found in rule-based agents, and we show how the choice of strategy can influence the information an agent can take into account when making decisions (...)
     
    Export citation  
     
    My bibliography   1 citation  
  10.  22
    A Logic of Situated Resource-Bounded Agents.Natasha Alechina & Brian Logan - 2009 - Journal of Logic, Language and Information 18 (1):79-95.
    We propose a framework for modelling situated resource-bounded agents. The framework is based on an objective ascription of intentional modalities and can be easily tailored to the system we want to model and the properties we wish to specify. As an elaboration of the framework, we introduce a logic, OBA, for describing the observations, beliefs, goals and actions of simple agents, and show that OBA is complete, decidable and has an efficient model checking procedure, allowing properties of agents specified in (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  11.  38
    Verifying Space and Time Requirements for Resource-Bounded Agents.Natasha Alechina, Piergiorgio Bertoli, Chiara Ghidini, Mark Jago, Brian Logan & Luciano Serafini - 2007 - In A. Lomuscio & S. Edelkamp (eds.), Model Checking and Artificial Intelligence. Springer.
    The effective reasoning capability of an agent can be defined as its capability to infer, within a given space and time bound, facts that are logical consequences of its knowledge base. In this paper we show how to determine the effective reasoning capability of an agent with limited memory by encoding the agent as a transition system and automatically verifying whether a state where the agent believes a certain conclusion is reachable from the start state. We present experimental results using (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    My bibliography  
  12.  21
    Modal Logics for Reasoning About Infinite Unions and Intersections of Binary Relations.Natasha Alechina, Philippe Balbiani & Dmitry Shkatov - 2012 - Journal of Applied Non-Classical Logics 22 (4):275 - 294.
    (2012). Modal logics for reasoning about infinite unions and intersections of binary relations. Journal of Applied Non-Classical Logics: Vol. 22, No. 4, pp. 275-294. doi: 10.1080/11663081.2012.705960.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  13.  32
    Functional Dependencies Between Variables.Natasha Alechina - 2000 - Studia Logica 66 (2):273-283.
    We consider a predicate logic Lfd where not all assignments of values to individual variables are possible. Some variables are functionally dependent on other variables. This makes sense if the models of logic are assumed to correspond to databases or states. We show that Lfd is undecidable but has a complete and sound sequent calculus formalisation.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  14.  9
    Editorial.Natasha Alechina - 2005 - Journal of Logic, Language and Information 14 (3):261-262.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  15.  5
    Formal Models of Awareness.Thomas Ågotnes & Natasha Alechina - 2014 - Journal of Logic, Language and Information 23 (2):105-106.
    This special issue on Formal Models of Awareness contains five papers that concentrate on different approaches to the notion of awareness. They include syntactic and semantic approaches to modelling awareness and an alternative view from the multi-agent systems perspective where awareness is identified as the ability to perceive and understand actions of other agents.Velázquez-Quesada studies a logic of plausibility acknowledgement models used to interpret the notions of implicit and explicit beliefs. The models use the notion of a formula being acknowledged (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  16.  5
    A Logic for Reasoning About Knowledge of Unawareness.Thomas Ågotnes & Natasha Alechina - 2014 - Journal of Logic, Language and Information 23 (2):197-217.
    In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of something Ann is not aware of”—without using a stronger statement such as “Ann knows that Bill is aware of \(p\) and Ann is not aware of \(p\) ”, for some particular \(p\) . In Halpern and Rêgo (Proceedings of KR 2006; Games Econ Behav 67(2):503–525, 2009b) Halpern and Rêgo introduced a logic (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  17.  4
    Book Review. [REVIEW]Natasha Alechina - 1997 - Journal of Logic, Language and Information 6 (3):342-344.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography