Abstract
Petri nets provide a promising framework for executing queries to logic programs. Petri net models for query processing in logic programming were initially developed by Murata and Zhang. In this paper, we show how this framework can be extended to be applicable to reasoning in the presence of inconsistency. This yields a Petri net model of programs that may be inconsistent in classical logic. This is interesting because large expert systems may often contain inconsistent information. The Petri net method proposed here suggests a robust way of preventing inconsistency from infecting a system and rendering it useless.
Original language | English (US) |
---|---|
Pages (from-to) | 281-292 |
Number of pages | 12 |
Journal | IEEE Transactions on Knowledge and Data Engineering |
Volume | 3 |
Issue number | 3 |
DOIs | |
State | Published - Sep 1991 |
Externally published | Yes |
Funding
Manuscript received July 1, 1989; revised October 13, 1990. T. Murata’s work was supported by the National Science Foundation under Grant CCR-8913580. T. Murata is with the Department of Electrical Engineering and Computer Science, University of Illinois at Chicago, Chicago, IL 60680. V. S. Subrahmanian is with the Department of Computer Science, University of Maryland, College Park, MD 20742. T. Wakayama is with Xerox Webster Research Center, Webster, NY IEEE Log Number 9101.542.
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics