Amanote Research
Register
Sign In
Lower Bound Cost Estimation for Logic Programs
doi 10.7551/mitpress/4283.003.0035
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 1997
Authors
Unknown
Publisher
The MIT Press
Related search
Lower-Bound Time-Complexity Analysis of Logic Programs
Determinacy Inference for Logic Programs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Hybrid Lower Bound for Parameter Estimation of Signals With Multiple Change-Points
IEEE Transactions on Signal Processing
Electronic Engineering
Signal Processing
Electrical
Lower-Bound Theorems for Pseudomanifolds
Discrete and Computational Geometry
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
Answer Sets for Prioritized Logic Programs
Ordering Optimisations for Concurrent Logic Programs
Logic Programs for Consistency-Based Diagnosis.
Lower Bound Theorems for General Polytopes
European Journal of Combinatorics
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Theoretical Computer Science
Topology
A Lower Bound for Jumbled Indexing
