Add to ORKGAn algorithm is described which computes stable mod-els of propositional logic programs with negation as fail-ure using the Assumption Based Truth Maintenance mechanism. Since stable models of logic programs are closely connected to stable expansions of a class of auto-epistemic theories, this algorithm points to a link be-tween stable expansions of a class of autoepistemic the-ories and ATMS structure
We investigate the operator producing a stable theory out of its objective part (A stable theory is ...
AbstractThe stable model semantics for logic programs is extended from ground literals onto open lit...
De Kleer’s Assumption-based Truth Maintenance System (ATMS) is a propositional inference engine de-s...
The stable model semantics is now one of the standard semantics for general logic programs. A simple...
In analogy to the Davis--Putnam procedure we develop a new procedure for computing stable models of ...
In analogy to the Davis-Putnam procedure we develop a new procedure for computing stable models of p...
Assumption-based truth maintenance systems have become a powerful and widely used tool in Artificial...
In the last years computational logic, and particularly non-monotonic reasoning, was introduced as a...
AbstractIn order to develop a proof procedure of multi-agent autoepistemic Logic (MAEL), a natural f...
This paper presents distributed algorithms for performing truth-maintenance and belief revision task...
AbstractPrevious researchers have proposed extensions of logic programming to deal with true negatio...
This paper deals with contradictory information in common-sense reasoning. It is often the case that...
AbstractUnderstanding the stable model semantics is an important topic in logic programming and nonm...
For a general logic program, a set of n + 1 logic values is considered and an undened value denoted ...
AbstractGelfond and Lifschitz (1988) proposed the notion of a stable model of a logic program. We es...
We investigate the operator producing a stable theory out of its objective part (A stable theory is ...
AbstractThe stable model semantics for logic programs is extended from ground literals onto open lit...
De Kleer’s Assumption-based Truth Maintenance System (ATMS) is a propositional inference engine de-s...
The stable model semantics is now one of the standard semantics for general logic programs. A simple...
In analogy to the Davis--Putnam procedure we develop a new procedure for computing stable models of ...
In analogy to the Davis-Putnam procedure we develop a new procedure for computing stable models of p...
Assumption-based truth maintenance systems have become a powerful and widely used tool in Artificial...
In the last years computational logic, and particularly non-monotonic reasoning, was introduced as a...
AbstractIn order to develop a proof procedure of multi-agent autoepistemic Logic (MAEL), a natural f...
This paper presents distributed algorithms for performing truth-maintenance and belief revision task...
AbstractPrevious researchers have proposed extensions of logic programming to deal with true negatio...
This paper deals with contradictory information in common-sense reasoning. It is often the case that...
AbstractUnderstanding the stable model semantics is an important topic in logic programming and nonm...
For a general logic program, a set of n + 1 logic values is considered and an undened value denoted ...
AbstractGelfond and Lifschitz (1988) proposed the notion of a stable model of a logic program. We es...
We investigate the operator producing a stable theory out of its objective part (A stable theory is ...
AbstractThe stable model semantics for logic programs is extended from ground literals onto open lit...
De Kleer’s Assumption-based Truth Maintenance System (ATMS) is a propositional inference engine de-s...