Stratified default theories-Reference-Cited by-同舟云学术

Stratified default theories

Published:1995 Issue: Volume: Page:456-470
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Cholewiński Paweł

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0022275

Reference14 articles.

1. K. Apt and H.A. Blair. Arithmetical classification of perfect models of stratified programs. Fundamenta Informaticae, 12:1–17, 1990.

2. K. Apt, H.A. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89–142, Los Altos, CA, 1987. Morgan Kaufmann.

3. N. Bidoit and Ch. Proidevaux. General logical databases and programs: Default logic semantics and stratification. Information and Computation, 91:15–54, 1991.

4. P. Cholewiński, W. Marek, A. Mikitiuk and M. Truszczyński. Experimenting with default logic In Proceedings of ICLP-95, MIT Press, to appear.

5. P. Cholewiński. Seminormal stratified default theories. Technical Report 238-93, University of Kentucky, Lexington, 1993.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Symbolic Production Grammars in LSCs Testing;Computer and Information Science 2012;2012

2. Epistemic Information in Stratified M-Spaces;Information;2011-12-16

3. Knowledge Base Stratification and Merging Based on Degree of Support;Lecture Notes in Computer Science;2009

4. Logic programming with infinite sets;Annals of Mathematics and Artificial Intelligence;2005-08

5. Representing Knowledge in A-Prolog;Computational Logic: Logic Programming and Beyond;2002