Results 1  10
of
10
MacVisSTA: A System for Multimodal Analysis of Human Communication and Interaction
, 2007
"... ..."
(Show Context)
Multimodal logic programming
 Theoretical Computer Science
, 2006
"... We give a framework for developing the least model semantics, fixpoint semantics, and SLDresolution calculi for logic programs in multimodal logics whose frame restrictions consist of the conditions of seriality (i.e. ∀x ∃y Ri(x, y)) and some classical firstorder Horn formulas. Our approach is dir ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
(Show Context)
We give a framework for developing the least model semantics, fixpoint semantics, and SLDresolution calculi for logic programs in multimodal logics whose frame restrictions consist of the conditions of seriality (i.e. ∀x ∃y Ri(x, y)) and some classical firstorder Horn formulas. Our approach is direct and no special restriction on occurrences of ✷i and ✸i is required. We apply our framework for a large class of basic serial multimodal logics, which are parameterized by an arbitrary combination of generalized versions of axioms T, B, 4, 5 (in the form, e.g., 4: ✷iϕ → ✷j✷kϕ) and I: ✷iϕ → ✷jϕ. Another part of the work is devoted to programming in multimodal logics intended for reasoning about multidegree belief, for use in distributed systems of belief, or for reasoning about epistemic states of agents in multiagent systems. For that we also use the framework, and although these latter logics belong to the mentioned class of basic serial multimodal logics, the special SLDresolution calculi proposed for them are more efficient.
On modal deductive databases
 Proceedings of ADBIS 2005, LNCS 3631
, 2005
"... We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algorithm, the topdown evaluation algorithm, and the magicset transformation for MDatalog queries. The results of this paper ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
(Show Context)
We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algorithm, the topdown evaluation algorithm, and the magicset transformation for MDatalog queries. The results of this paper like soundness and completeness of the topdown evaluation algorithm or correctness of the magicset transformation are proved for the multimodal logics of belief KDI4s5, KDI45, KD4s5s, KD45(m), KD4Ig5a, and the class of serial contextfree grammar logics. We also show that MDatalog has PTIME data complexity in the logics KDI4s5, KDI45, KD4s5s, and KD45(m). 1
Reasoning about epistemic states of agents by modal logic programming
 Proceedings of CLIMA VI, LNAI 3900
, 2006
"... Abstract. Modal logic programming is one of appropriate approaches to deal with reasoning about epistemic states of agents. We specify here the least model semantics, the fixpoint semantics, and an SLDresolution calculus for modal logic programs in the multimodal logic KD4Ig5a, which is intended fo ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
(Show Context)
Abstract. Modal logic programming is one of appropriate approaches to deal with reasoning about epistemic states of agents. We specify here the least model semantics, the fixpoint semantics, and an SLDresolution calculus for modal logic programs in the multimodal logic KD4Ig5a, which is intended for reasoning about belief and common belief of agents. We prove that the presented SLDresolution calculus is sound and complete. We also present a formalization of the wise men puzzle using a modal logic program in KD4Ig5a. This shows that it is worth to study modal logic programming for multiagent systems. 1
An SLDresolution calculus for basic serial multimodal logics
 Proceedings of ICTAC 2005, LNCS 3722
, 2005
"... Abstract. We develop semantics for modal logic programs in basic serial multimodal logics, which are parameterized by an arbitrary combination of generalized versions of axioms T, B, 4,5(intheform,e.g., 4:✷iϕ → ✷j✷kϕ) andI: ✷iϕ → ✷jϕ. We do not assume any special restriction for the form of programs ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We develop semantics for modal logic programs in basic serial multimodal logics, which are parameterized by an arbitrary combination of generalized versions of axioms T, B, 4,5(intheform,e.g., 4:✷iϕ → ✷j✷kϕ) andI: ✷iϕ → ✷jϕ. We do not assume any special restriction for the form of programs and goals. Our fixpoint semantics and SLDresolution calculus are defined using the direct approach and closely reflect the axioms of the used modal logic. We prove that our SLDresolution calculus is sound and complete. 1
Beliefs in Agent Implementation
"... Abstract. 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 moda ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. 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. A distinction is made between a belief base language that can be used to represent an agent’s beliefs, and a belief query language that can be used to express queries to the agent’s belief base. We adopt and modify a proof procedure that decides if a belief query formula is derivable from the belief base of an agent. We show that the presented proof procedure is sound. 1
Modal logic programming revisited
"... ABSTRACT. We present optimizations for the modal logic programming system MProlog, including the standard form for resolution cycles, optimized sets of rules used as metaclauses, optimizations for the version of MProlog without existential modal operators, as well as iterative deepening search and ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ABSTRACT. We present optimizations for the modal logic programming system MProlog, including the standard form for resolution cycles, optimized sets of rules used as metaclauses, optimizations for the version of MProlog without existential modal operators, as well as iterative deepening search and tabulation. Our SLDresolution calculi for MProlog in a number of modal logics are still strongly complete when resolution cycles are in the standard form and optimized sets of rules are used. We also show that the labelling technique used in our direct approach is relatively better than the Skolemization technique used in the translation approaches for modal logic programming. KEYWORDS: modal logic, logic programming, MProlog. DOI:10.3166/JANCL.19.167–181 c ○ 2009 Lavoisier, Paris
IOS Press Foundations of Modal Deductive Databases
"... Abstract. We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algorithm, the topdown evaluation algorithm, and the magicset transformation for MDatalog queries. The results of t ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algorithm, the topdown evaluation algorithm, and the magicset transformation for MDatalog queries. The results of this paper like soundness and completeness of the topdown evaluation algorithm or correctness of the magicset transformation are proved for the multimodal logics of belief KDI4s5, KDI45, KD4s5s, KD45 (m), KD4Ig5a, and the class of serial contextfree grammar logics. We also show that MDatalog has PTIME data complexity in the logics KDI4s5, KDI45, KD4s5s, and KD45 (m).
PrologBased Reasoning Layer for CounterStrike Agents
"... Abstract. In this paper it is shown an application of an agentoriented programming paradigm with a reasoning layer based on a logic programming. The presented solution was used to build bots in CounterStrike video game. The software architecture for new bots has been presented and benefits were di ..."
Abstract
 Add to MetaCart
Abstract. In this paper it is shown an application of an agentoriented programming paradigm with a reasoning layer based on a logic programming. The presented solution was used to build bots in CounterStrike video game. The software architecture for new bots has been presented and benefits were discussed. This article does not discusses all the work in detail, but provides more general idea about research, which was done.