Lower-Bound Time-Complexity Analysis of Logic Programs

doi 10.7551/mitpress/4283.003.0033

Full Text

Abstract

Available in

Date

Authors

Unknown

Publisher

The MIT Press

Related search

Lower Bound Cost Estimation for Logic Programs

1997English

A Time Complexity Lower Bound for Adaptive Mutual Exclusion

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2011English

Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2017English

Complexity of Nonrecursive Logic Programs With Complex Values

1998English

Incremental Analysis of Logic Programs

1995English

Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Mode Analysis of Functional Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Automatic Termination Analysis of Logic Programs

1997English

Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy