Default theories over monadic languages

Authors:
Michael Kaminski;Julia Rubin-Mosin
Affiliations:
Department of Computer Science, Technion--Israel Institute of Technology, Haifa, Israel;IBM Haifa Labs, Haifa University Campus, Carmel Mountains, Haifa, Israel
Venue:
Theoretical Computer Science - Logic, language, information and computation
Year:
2006

Citing 6
Cited 0

Introduction to mathematical logic (3rd ed.)

Introduction to mathematical logic (3rd ed.)
A logical framework for default reasoning

Artificial Intelligence
A comparative study of open default theories

Artificial Intelligence
A note on the stable model semantics for logic programs

Artificial Intelligence
Foundations of Logic Programming

Foundations of Logic Programming
Similarity preservation in default logic

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we compare the semantical and syntactical definitions of extensions for open default theories. We prove that, over monadic languages, these definitions are equivalent and do not depend on the cardinality of the underlying infinite world. We also show that, under the domain closure assumption, one free variable open default theories are decidable.