Analysing Logic Programs by Reasoning Backwards-Reference-Cited by-同舟云学术

Analysing Logic Programs by Reasoning Backwards

Published:2004 Issue: Volume: Page:152-188
ISSN:0302-9743
Container-title:Program Development in Computational Logic
language:
Short-container-title:

Author:

Howe Jacob M.,King Andy,Lu Lunjin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-25951-0_6.pdf

Reference66 articles.

1. Lecture Notes in Computer Science;A. Aiken,1994

2. Armstrong, T., Marriott, K., Schachte, P., Søndergaard, H.: Two Classes of Boolean Functions for Dependency Analysis. Science of Computer Programming 31(1), 3–45 (1998)

3. Lecture Notes in Computer Science;F. Benoy,1997

4. Boye, J., Drabent, W., Małuszyński, J.: Declarative Diagnosis of Constraint Programs: an Assertion-based Approach. In: Proceedings of the Third International Workshop on Automated Debugging, pp. 123–141. University of Linköping Press (1997)

5. Brodsky, A., Sagiv, Y.: Inference of Monotonicity Constraints in Datalog Programs. In: Symposium on Principles of Database Systems, pp. 190–199. ACM Press, New York (1989)

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

1. A lightweight approach to nontermination inference using Constrained Horn Clauses;Software and Systems Modeling;2024-03-14

2. Transformation-Enabled Precondition Inference;Theory and Practice of Logic Programming;2021-09-23

3. Bounded Symbolic Execution for Runtime Error Detection of Erlang Programs;Electronic Proceedings in Theoretical Computer Science;2018-09-12

4. An iterative approach to precondition inference using constrained Horn clauses;Theory and Practice of Logic Programming;2018-07

5. Heyting Domains for Constraint Abduction;Lecture Notes in Computer Science;2006