1,899 research outputs found
A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report
Nested logic programs have recently been introduced in order to allow for
arbitrarily nested formulas in the heads and the bodies of logic program rules
under the answer sets semantics. Nested expressions can be formed using
conjunction, disjunction, as well as the negation as failure operator in an
unrestricted fashion. This provides a very flexible and compact framework for
knowledge representation and reasoning. Previous results show that nested logic
programs can be transformed into standard (unnested) disjunctive logic programs
in an elementary way, applying the negation as failure operator to body
literals only. This is of great practical relevance since it allows us to
evaluate nested logic programs by means of off-the-shelf disjunctive logic
programming systems, like DLV. However, it turns out that this straightforward
transformation results in an exponential blow-up in the worst-case, despite the
fact that complexity results indicate that there is a polynomial translation
among both formalisms. In this paper, we take up this challenge and provide a
polynomial translation of logic programs with nested expressions into
disjunctive logic programs. Moreover, we show that this translation is modular
and (strongly) faithful. We have implemented both the straightforward as well
as our advanced transformation; the resulting compiler serves as a front-end to
DLV and is publicly available on the Web.Comment: 10 pages; published in Proceedings of the 9th International Workshop
on Non-Monotonic Reasonin
Quantified Propositional Gödel Logics
It is shown that Gqpâ, the quantified propositional Gödel logic based on the truth-value set Vâ = {1 - 1/n : nâ„1}âȘ{1}, is decidable. This result is obtained by reduction to BĂŒchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqpâ as the intersection of all finite-valued quantified propositional Gödel logics
Constructive Mathematics in Theory and Programming Practice
The first part of the paper introduces the varieties of modern constructive mathematics, concentrating on Bishopâs constructive mathematics(BISH). It gives a sketch of both Myhillâs axiomatic system for BISH and a constructive axiomatic development of the real line R. The second part of the paper focuses on the relation between constructive mathematics and programming, with emphasis on Martin-Lofâs theory of types as a formal system for BISH
- âŠ