Amanote Research

Amanote Research

    RegisterSign In

Fast and Precise Regular Approximations of Logic Programs

doi 10.7551/mitpress/4316.003.0058
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 1994

Authors

Unknown

Publisher

The MIT Press


Related search

Rough Approximations in Varieties of Regular Languages

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2011English

Bounds and Approximations for Multistage Stochastic Programs

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2016English

Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics

Logic Journal of the IGPL
Philosophy
2007English

Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Regular Linear-Time Temporal Logic

2010English

Learnability of Constrained Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Disjunctive Signed Logic Programs

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
1997English

Relating Logic Programs and Attribute Grammars

Decision Support Systems
DevelopmentalArtsInformation SystemsEducational PsychologyHumanitiesManagementManagement Information Systems
1987English

Incremental Analysis of Logic Programs

1995English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy