Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Logic programming
Stratified, weak stratified and three-valued semantics
Fundamenta Informaticae - Special issue on LOGIC PROGRAMMING
Negation by default and unstratifiable logic programs
Selected papers of the workshop on Deductive database theory
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Acyclic logic programs and the completeness of SLDNF-resolution
Theoretical Computer Science
Reasoning about termination of pure Prolog programs
Information and Computation
A logical semantics for depth-first Prolog with ground negation
Theoretical Computer Science
Towards a logical semantics for pure Prolog
Science of Computer Programming - Special issue on the 6th European symposium on programming
Logic Programs and Many-Valued Logic
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Practical methods for proving termination of general logic programs
Journal of Artificial Intelligence Research
Strictly level-decreasing logic programs
IW-FM'98 Proceedings of the 2nd Irish conference on Formal Methods
Topology And The Semantics Of Logic Programs
Fundamenta Informaticae
Logic Programs under Three-Valued Łukasiewicz Semantics
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A note on the relationships between logic programs and neural networks
IW-FM'00 Proceedings of the 4th Irish conference on Formal Methods
| Hi-index | 0.00 |
Several important classes of normal logic programs, including the classes of acyclic, acceptable, and locally hierarchical programs, have the property that every program in the class has a unique two-valued supported model. In this paper, we call such classes unique supported model classes. We analyse and characterize these classes by means of operators on three-valued logics. Our studies will motivate the definition of a larger unique supported model class which we call the class of Φ*-accessible programs. Finally, we show that the class of Φ*-accessible programs is computationally adequate in that every partial recursive function can be implemented by such a program.