Theory of generalized annotated logic programming and its applications
M Kifer, VS Subrahmanian - The Journal of Logic Programming, 1992 - Elsevier
Annotated logics were introduced in [43] and later studied in [5, 7, 31, 32]. In [32],
annotations were extended to allow variables and functions, and it was argued that such …
annotations were extended to allow variables and functions, and it was argued that such …
Probabilistic logic programming
R Ng, VS Subrahmanian - Information and computation, 1992 - Elsevier
Of all scientific investigations into reasoning with uncertainty and chance, probability theory
is perhaps the best understood paradigm. Nevertheless, all studies conducted thus far into …
is perhaps the best understood paradigm. Nevertheless, all studies conducted thus far into …
COMBINING KNOWLEDGE BASES CONSISTING OF FIRST‐ORDER THEORIES
Consider the construction of an expert system by encoding the knowledge of different
experts. Suppose the knowledge provided by each expert is encoded into a knowledge …
experts. Suppose the knowledge provided by each expert is encoded into a knowledge …
Paraconsistent logics and paraconsistency
Publisher Summary This chapter discusses paraconsistent logics (PL) and paraconsistency.
PL are the logics of inconsistent but nontrivial theories. A deductive theory is paraconsistent …
PL are the logics of inconsistent but nontrivial theories. A deductive theory is paraconsistent …
Amalgamating knowledge bases
VS Subrahmanian - ACM Transactions on Database Systems (TODS), 1994 - dl.acm.org
The integration of knowledge for multiple sources is an important aspect of automated
reasoning systems. When different knowledge bases are used to store knowledge provided …
reasoning systems. When different knowledge bases are used to store knowledge provided …
[HTML][HTML] Multiple Criteria Decision Analysis (MCDA) for evaluating cancer treatments in hospital-based health technology assessment: The Paraconsistent Value …
Background In recent years, the potential of multi-criteria decision analysis (MCDA) in the
health field has been discussed widely. However, most MCDA methodologies have given …
health field has been discussed widely. However, most MCDA methodologies have given …
Reasoning with rough sets
S Akama, T Murai, Y Kudo - Logical Approaches to Granularity-Based …, 2018 - Springer
Pawlak proposed rough set theory in 1982. It can be seen as an extension of set theory, in
which a subset of a universe is formalized by a pair of sets, ie, the lower and upper …
which a subset of a universe is formalized by a pair of sets, ie, the lower and upper …
Annotated semantics for defeasible deontic reasoning
K Nakamatsu, JM Abe, A Suzuki - Rough Sets and Current Trends in …, 2001 - Springer
In this paper, we propose an annotated logic program called an EVALPSN (Extended Vector
Annotated Logic Program with Strong Negation) to formulate the semantics for a defeasible …
Annotated Logic Program with Strong Negation) to formulate the semantics for a defeasible …
[图书][B] Towards Paraconsistent Engineering
S Akama - 2016 - Springer
Paraconsistent logics refer to non-classical logical systems, which can properly handle
contradictions. They can overcome defects of classical logic. Initially, they were motivated by …
contradictions. They can overcome defects of classical logic. Initially, they were motivated by …
Reasoning in inconsistent knowledge bases
J Grant, VS Subrahmanian - IEEE Transactions on Knowledge …, 1995 - ieeexplore.ieee.org
Databases and knowledge bases could be inconsistent in many ways. For example, during
the construction of an expert system, we may consult many different experts. Each expert …
the construction of an expert system, we may consult many different experts. Each expert …