The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Modal logic is a paradigm for several useful and applicable formal systems in computer science, and, in particular, for temporal logics of various kinds. It generally retains the low complexity of classical propositional logic, but notable exceptions exist that present higher complexity or are even undecidable. In search of computationally well-behaved fragments, clausal forms and other sub-propositional...
A crime is often caused by the limited predictability of the accused. In the court, the judge needs to investigate the predictability andthe intention of the agent. Thus far, we have formalized the reasoning process of judgement by Action Model in Dynamic Epistemic Logic (DEL), but simple DEL cannot handle the predictability well because the prediction in legal cases depends not only on the states...
This paper proposes a logical formalization of agents' beliefs which admits an agent's misinterpretation of the other agents' actions to her. Most of the previous logical studies on dynamic changes of knowledge and belief often assume that agents are idealistic or logical omniscient in the sense that they will not make a mistake in reasoning and in reacting to the other agent's action. However, our...
A practical reasoning agent model with rich temporal knowledge and capability updating its mental attitudes regarding spatiotemporal relations through perception and deduction is proposed. The basic idea is to construct an event as spatial relation holding during a temporal interval. Modal logic is used for representation of agent's practical reasoning about preserving and changing spatiotemporal...
Automated Theorem Proving systems are enormously powerful computer programs capable of solving immensely difficult problems. The extreme capabilities of these systems lie on some well-established proof systems. Semantic tableau is such a proof system used to prove the validity of a formula by contradiction and can produce a counterexample if it fails. It can also be used to prove whether a formula...
The core capability of an agent is it can be make a rational choice for its action decision, so the cooperation among agents is the key for state transformation in a multi-agent system (MAS). In an open and dynamic system, agents must deal with uncertain factors by model those uncertainties into simplified categories that is significant for decision-making in a specified domain. Chance discovery (CD)...
Uncertainty information is in many information processing systems, such as data integration system, and expert systems, and so on. There is a contradiction, reasoning detailed information on system requirements can be the most accurate results, while the expert system input is uncertain. So how to reason using uncertain information, and get good results, is our main concern, but also the field of...
Authorization policies provide access control to the system resource. This paper proposes a formal modal logic approach for the specification and reasoning about authorizations. Especially we investigate and handle the situation where the security agent's knowledge is not specific and the decisions for accessing the system resource are to be made based on the agent's knowledge. We introduce modal...
Graded modal logic is the formal language obtained from ordinary modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive interpretations such as "It is true at no fewer than 15 accessible worlds that ...", or "It is true at no more than 2 accessible worlds that ...". We investigate...
The use of rational agents for modelling real world problems has both been heavily investigated and become well accepted, with BDI Logic being a widely used architecture to represent and reason about rational agency. However, in the real world, we often have to deal with different levels of confidence in our beliefs, desires, and intentions. This paper extends our previous framework that integrated...
Defeasible logic is a non-monotonic formalism that deals with incomplete and conflicting information. Modal logic deals with necessity and possibility, exhibiting defeasibility; thus, it is possible to combine defeasible logic with modal operators. This paper reports on the extension of the DR-DEVICE defeasible reasoner with modal and deontic logic operators. The aim is a practical defeasible reasoner...
There are mainly two known approaches to the representation of temporal information in Computer Science: modal logic approaches (including tense logics and hybrid temporal logics) and predicate logic approaches (including temporal argument methods and reified temporal logics). On one hand, while tense logics, hybrid temporal logics and temporal argument methods enjoy formal theoretical foundations,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.