Resolution for skeptical stable model semantics

Journal of Automated Reasoning

Volumn 27, Issue 4, 2001, Pages 391-421

  Bonatti, P A ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Floundering; Resolution; Skeptical derivations; Stable semantics; Strategies

Indexed keywords

COMPUTATIONAL COMPLEXITY; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; PROBLEM SOLVING;

RESOLUTION; STABLE SEMANTICS;

SEMANTICS;

EID: 0035499417     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011960831261     Document Type: Article

References (23)

1. On the safe termination of prolog programs
2. Implementing stable semantics by linear programming
3. Autoepistemic logics as a unifying framework for the semantics of logic programs
4. Sequent calculi for default and autoepistemic logics
5. Resolution for skeptical stable semantics
6. A sequent calculus for skeptical default logic
7. A sequent calculus for circumscription
8. Tabled evaluation with delaying for general logic programs
9. Computation of stable models and its integration with logical query processing
10. Disunification: A survey
11. On the relation between stable and well-founded semantics of logic programs
12. The stable model semantics for logic programming
13. A non-ground realization of the stable and well-founded semantics
14. Splitting a logic program
15. Computing intersection of autoepistemic expansions
16. Efficient implementation of the well-founded and stable model semantics
17. SMODELS - An implementation of the stable model and well-founded semantics for normal LP
18. Skeptical query answering in constrained default logic
19. The expressive powers of the logic programming semantics
20. WFS+Branch and bound=stable models
21. The well-founded semantics for general logic programs