Filters








185,588 Hits in 3.8 sec

Epistemic Extension of Propositional Preference Logics

Jacques Wainer
1993 International Joint Conference on Artificial Intelligence  
The second part of this paper discusses a methodof extending any propositional preference logics into a corresponding extended logics that allows for a knowledge operator.  ...  Most of the current nonmonotonic logics are limited to a propositional or a first-order language.  ...  For example, having to represent nested beliefs would bring the need of a modal operator to represent the hearer's beliefs (which is done implicitly now) when it occurs within the scope of the speaker's  ... 
dblp:conf/ijcai/Wainer93 fatcat:vxjfwjc5inhw7fzodd7dkixlpe

Implementing BDI-like Systems by Direct Execution

Michael Fisher
1997 International Joint Conference on Artificial Intelligence  
While the Belief, Desire, Intention (BDI) framework is one of the most influential and appealing approaches to rational agent architectures, a gulf often exists between the high-level BDI model and its  ...  In contrast, the Concurrent METATEM language, being based upon executable formal specifications, presents a close link between the theory and implementation, yet lacks some of the features considered central  ...  Temporal logic is seen as classical logic extended with various modalities for representing temporal aspects of logical formulae [Emerson, 1990] .  ... 
dblp:conf/ijcai/Fisher97 fatcat:nwcwjnd4xje2lmpyyrwuk5dc5i

Beliefs in Agent Implementation [chapter]

Laurens Winkelhagen, Mehdi Dastani, Jan Broersen
2006 Lecture Notes in Computer Science  
This paper extends a programming language for implementing cognitive agents with the capability to explicitly represent beliefs and reason about them.  ...  In this programming language, the beliefs of agents are implemented by modal logic programs, where beliefs are represented by explicit modal operators.  ...  Definition 4 . 4 (extended base language) Let L be the basic langauge as defined in 1. Let B i be a modal operator for an agent i ∈ Agents.  ... 
doi:10.1007/11691792_1 fatcat:mipk4sofundqzexpr67zxu5yr4

Programming Resource-Bounded Deliberative Agents

Michael Fisher, Chiara Ghidini
1999 International Joint Conference on Artificial Intelligence  
The mechanism we use to capture finite resources is to replace the standard modal logic previously used to represent an agent's beliefs, with a multi-context representation of belief, thus providing tight  ...  On the other hand, many of the agent-based programming languages used for implementing 'real* agents lack firm logical semantics.  ...  In particular, the METATEM family of programming languages originally contained no sophisticated mechanisms for representing deliberation within an agent, i.e. the process that an agent carries out in  ... 
dblp:conf/ijcai/FisherG99 fatcat:efm4rwajfncsjiieh5qqpucsse

Page 3543 of Mathematical Reviews Vol. , Issue 2004e [page]

2004 Mathematical Reviews  
In the proposed framework, no formula of an object language can be valid in all of the worlds.  ...  “This note—an extended abstract rather than a full-fledged paper—should be read as an appendix to the paper cited above. Although some definitions are repeated here, many are not.  ... 

Computational logic-based agents

Francesca Toni, Jamal Bentahar
2008 Autonomous Agents and Multi-Agent Systems  
The problems discussed range from agent programming languages through a BDI agent-based programming language, to agent communication through a multi-issue bilateral negotiation, to logic programming-based  ...  agents realising a distributed abductive inference mechanism, to mental attitudes representation through a theory of intention representation, and automated, nondeterministic planning for extended reachability  ...  Jamal Bentahar would also like to thank NSERC (Canada) and FQRNT (Quebec) for their financial support.  ... 
doi:10.1007/s10458-008-9035-z fatcat:c7mx2qgplbb5ndcexyyfjrsviu

Temporal Development Methods for Agent-Based

Michael Fisher
2005 Autonomous Agents and Multi-Agent Systems  
This approach is based on the use of temporal logics to represent both the behaviour of individual agents, and the macro-level behaviour of multi-agent systems.  ...  We also show how the basic framework can be extended in various ways to handle the representation and implementation of agents capable of more complex deliberation and reasoning.  ...  By extending our basic temporal logic with a multi-modal KD45 dimension representing belief, we can represent this as B ag 1 p [69], i.e. that agent ag 1 believes p.  ... 
doi:10.1007/s10458-004-3140-4 fatcat:5jq5gsi42fhtvgcli7waj6auge

Prototyping 3APL in the Maude Term Rewriting Language [chapter]

M. Birna van Riemsdijk, Frank S. de Boer, Mehdi Dastani, John-Jules Ch. Meyer
2007 Lecture Notes in Computer Science  
This means that it has explicit constructs for representing the high-level mental attitudes of an agent. A 3APL agent has beliefs, a plan,  ...  The language has been shown to be suitable both as a logical framework in which many other logics can be represented, and as a semantic framework, through which programming languages with an operational  ...  In that paper, Mobile Maude is presented, which is a mobile agent language extending Maude, and supporting mobile computation.  ... 
doi:10.1007/978-3-540-69619-3_6 fatcat:lw23lsxxljaktfpfp55urt3thm

Prototyping 3APL in the Maude term rewriting language

M. Birna van Riemsdijk, Frank S. de Boer, Mehdi Dastani, John-Jules Ch. Meyer
2006 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems - AAMAS '06  
This means that it has explicit constructs for representing the high-level mental attitudes of an agent. A 3APL agent has beliefs, a plan,  ...  The language has been shown to be suitable both as a logical framework in which many other logics can be represented, and as a semantic framework, through which programming languages with an operational  ...  In that paper, Mobile Maude is presented, which is a mobile agent language extending Maude, and supporting mobile computation.  ... 
doi:10.1145/1160633.1160865 dblp:conf/atal/RiemsdijkBDM06 fatcat:ktrjuvbsbrggnoo7me2m5r56pm

The Lockean Thesis and the Logic of Belief [chapter]

James Hawthorne
2009 Degrees of Belief  
language sentences of a language L for predicate logic with identity.  ...  Definition 5 the Properly Extendable Rudimentary n-Level Confidence-Belief Definition 6 the n-Level Confidence-Belief Pairs: Given a language L for predicate logic, the (refined) n-level confidence-belief  ... 
doi:10.1007/978-1-4020-9198-8_3 fatcat:c5zq4lq3d5dv7cnymuteboftbq

Dynamic Epistemic Logic for Implicit and Explicit Beliefs

Fernando R. Velázquez-Quesada
2014 Journal of Logic, Language and Information  
Dynamic epistemic logics have explored how knowledge and beliefs change as consequence of, among others, acts of observation and upgrade.  ...  We propose a combination of existing works in order to represent implicit and explicit beliefs.  ...  Conclusions and further work We have presented a framework for representing implicit and explicit beliefs.  ... 
doi:10.1007/s10849-014-9193-0 fatcat:jyksf7e7tfgtdho7nlczp37slu

COMPUTATIONAL LOGICS AND AGENTS: A ROAD MAP OF CURRENT TECHNOLOGIES AND FUTURE TRENDS

Michael Fisher, Rafael H. Bordini, Benjamin Hirsch, Paolo Torroni
2007 Computational intelligence  
However, with dependability and safety in mind, it is vital that the mechanisms for representing and implementing agents are clear and consistent.  ...  Such a logical basis not only presents the clarity and consistency required but also allows for important techniques such as logical verification to be applied.  ...  In particular, the logics used bring together: • an informational component, so as to be able to represent the agent's beliefs or knowledge; • a motivational component, in order to representing the agent's  ... 
doi:10.1111/j.1467-8640.2007.00295.x fatcat:c76gbfuuwngjpk7ebs2jkpfxfi

Possibilistic vs. Relational Semantics for Logics of Incomplete Information [chapter]

Mohua Banerjee, Didier Dubois, Lluis Godo
2014 Communications in Computer and Information Science  
The extended logic, called MEL + has the same axioms as, and is in some sense equivalent to, S5 with a restricted language, but with the same expressive power.  ...  This paper proposes an extension of the MEL logic to a language containing modal formulae of depth 0 or 1 only.  ...  Extending MEL to reason about the actual world and someone's beliefs In this section we extend the language of MEL to allow dealing with not only subjective formulas that express an agent's beliefs, but  ... 
doi:10.1007/978-3-319-08795-5_35 fatcat:h2tkqeuydvbtpbbwzwyccxhvnq

Nested Epistemic Logic Programs [chapter]

Kewen Wang, Yan Zhang
2005 Lecture Notes in Computer Science  
Therefore, our work establishes a unifying framework for both nested logic programs and epistemic logic programs.  ...  We prove that equilibrium view semantics extends both the answer sets of nested logic programs and the world views of epistemic logic programs.  ...  The authors would like to thank the three referees for their comments. In particular, the comments from one referee greatly helped the improvement of the paper.  ... 
doi:10.1007/11546207_22 fatcat:l6sk5734xbcgxfyn4obago72r4

An Action Description Language for Iterated Belief Change

Aaron Hunter, James P. Delgrande
2007 International Joint Conference on Artificial Intelligence  
In order to represent such problems, we extend an existing epistemic action language to allow erroneous initial beliefs.  ...  Further, we illustrate how to solve epistemic projection problems in our new language by translating action descriptions into extended logic programs.  ...  It would be straightforward to extend our results to allow arbitrary action sequences by using the full definition of belief evolution. 4 An Action Language for Belief Change Syntax Our language is obtained  ... 
dblp:conf/ijcai/HunterD07 fatcat:3ehbavvggbexljttnmnmahqssi
« Previous Showing results 1 — 15 out of 185,588 results