Answer Set Programming Phase Transition: A Study on Randomly Generated Programs-Reference-Cited by-同舟云学术

Answer Set Programming Phase Transition: A Study on Randomly Generated Programs

Published:2003 Issue: Volume: Page:239-253
ISSN:0302-9743
Container-title:Logic Programming
language:
Short-container-title:

Author:

Zhao Yuting,Lin Fangzhen

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24599-5_17

Reference17 articles.

1. Babovich, Y., Erdem, E., Lifschitz, V.: Fages’ theorem and answer set programming. In: Proc. of NMR 2000 (2000)

2. Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the Really Hard Problems Are. In: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI 1991, Sydney, Australia, pp. 331–337 (1991)

3. Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logics and Databases, pp. 293–322. Plenum Press, New York (1978)

4. Lecture Notes in Computer Science;T. Eiter,1997

5. Fages, F.: Consistency of clark’s completion and existence of stable of stable models. Journal of Methods of Logic in Computer Science 1, 51–60 (1994)

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

1. Gradient-Based Supported Model Computation in Vector Spaces;Logic Programming and Nonmonotonic Reasoning;2022

2. New models for generating hard random boolean formulas and disjunctive logic programs;Artificial Intelligence;2020-02

3. Generating Random Logic Programs Using Constraint Programming;Lecture Notes in Computer Science;2020

4. Backdoors to tractable answer set programming;Artificial Intelligence;2015-03

5. Random logic programs: Linear model;Theory and Practice of Logic Programming;2014-09-05