Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Declarative Semantics for Contradictory Modular Logic Anastasia Analyti & Sakti Pramanik
 

Summary: Declarative Semantics for Contradictory Modular Logic
Programs
Anastasia Analyti & Sakti Pramanik
Department of Computer Science, Michigan State University, E. Lansing, MI 48824
E-mail: analyti@cps.msu.edu, pramanik@cpswh.msu.edu
Abstract. A complex reasoning system can be designed as an interaction between reasoning
modules. A module consists of a declaration of exported/imported predicates and a set of rules
containing both negation by default and classical negation. A prioritized modular logic program
(PMP) consists of a set of modules and a partial order where M is a module and p is a predicate exported by M. Because of the classical negation,
conflicts may arise within and among modules. The partial order reliability of the predicate definitions contributing to the conflict. We present the reliable
semantics for PMPs. The goal of the reliable semantics is to draw reliable conclusions from
possibly contradictory PMPs.
1 Introduction
Modules in a reasoning system arise as a result of a functional decomposition of a
complex reasoning task into a number of simpler subtasks. Each module is an interactive
reasoning subsystem that is used for the (often partial) definition of its exported
predicates. Each module contains a set of rules viewed as an open logic theory [1] with a
set of input literals. A module represents an incomplete specification of some domain

  

Source: Analyti, Anastasia - Institute of Computer Science, Foundation of Research and Technology, Hellas

 

Collections: Computer Technologies and Information Sciences