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

Logic Journal of the IGPL - United Kingdom
doi 10.1093/jigpal/jzm059
Full Text
Abstract

Available in full text

Categories
Philosophy
Date
Authors
Publisher

Oxford University Press (OUP)

Related search

ExpTime Tableau Decision Procedures for Regular Grammar Logics With Converse

Studia Logica
Philosophy of ScienceLogicHistory
2011English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

The Equivalent Conversion Between Regular Grammar and Finite Automata

Journal of Software Engineering and Applications
2013English

Fast and Precise Regular Approximations of Logic Programs

1994English

Finite-Valued Logics for Information Processing

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2012English

Four-Valued Modal Logic: Kripke Semantics and Duality

English

Constructing a Fuzzy Grammar for Syntactic Face Detection

English

The Logic of Unification in Grammar

Linguistics and Philosophy
LinguisticsPhilosophyLanguage
1990English

Mechanizing Programming Logics in Higher Order Logic

1989English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy