In this paper, we address the problem of checking whether two disjunctive logic programs possess exactly the same stable models. An existing translation-based method [14], which was designed for weight constraint prog...
详细信息
ISBN:
(纸本)354020721X
In this paper, we address the problem of checking whether two disjunctive logic programs possess exactly the same stable models. An existing translation-based method [14], which was designed for weight constraint programs supported by the SMODELS system, is generalized to the disjunctive case. Moreover, we report on our preliminary experiments with an implementation of the method, a translator called DLPEQ.
nlp is a compiler for nested logicprogramming under answer set semantics. It is designed as a front-end translating nested logic programs into disjunctive ones, whose answer sets are then computable by disjunctive lo...
详细信息
ISBN:
(纸本)354020721X
nlp is a compiler for nested logicprogramming under answer set semantics. It is designed as a front-end translating nested logic programs into disjunctive ones, whose answer sets are then computable by disjunctive logicprogramming systems, like dlv or gnt. nlp offers different translations: One is polynomial but necessitates the introduction of new atoms, another is exponential in the worst case but avoids extending the language. We report experimental results, comparing the translations on several classes of benchmark problems.
LPEQ and DLPEQ, two translators for automated equivalence testing of logic programs are discussed. the translators LPEQ and DLPEQ have been implemented in the C programming language under the Linux operating system. B...
详细信息
ISBN:
(纸本)354020721X
LPEQ and DLPEQ, two translators for automated equivalence testing of logic programs are discussed. the translators LPEQ and DLPEQ have been implemented in the C programming language under the Linux operating system. Both translators take two logic programs and command line options as their input and produce a translation for equivalence testing as their output. the input files are assumed to be in an internal format, as produced by the front-end LPARSE of the SMODELS system.
We introduce a family of partial stable model semantics for logic programs with arbitrary aggregate relations. the semantics are parametrized by the interpretation of aggregate relations in three-valued logic. Any sem...
详细信息
ISBN:
(纸本)354020721X
We introduce a family of partial stable model semantics for logic programs with arbitrary aggregate relations. the semantics are parametrized by the interpretation of aggregate relations in three-valued logic. Any semantics in this family satisfies two important properties: (i) it extends the partial stable semantics for normal logic programs and (ii) total stable models are always minimal. We also give a specific instance of the semantics and show that it has several attractive features.
Strong equivalence is an important property for nonmonotonic formalisms, allowing safe local changes to a nonmonotonictheory. this paper considers strong equivalence for nonmonotonic causal theories of the kind intro...
详细信息
ISBN:
(纸本)354020721X
Strong equivalence is an important property for nonmonotonic formalisms, allowing safe local changes to a nonmonotonictheory. this paper considers strong equivalence for nonmonotonic causal theories of the kind introduced by McCain and Turner. Causal theories T-1 and T-2 are strongly equivalent if, for every causal theory T, T-1 boolean OR T and T-2 boolean OR T are equivalent (that is, have the same causal models). the paper introduces a convenient characterization of this property in terms of so-called SE-models, much as was done previously for answer set programs and default theories. A similar result is provided for the nonmonotonic modal logic UCL. the paper also introduces a reduction from the problem of deciding strong equivalence of two causal theories to the problem of deciding equivalence of two sets of propositional formulas.
We describe WSAT(CC), a local-search solver for computing models of theories in the language of propositional logic extended by cardinality atoms. WSAT(CC) is a processing back-end for the logic PS+, a recently propos...
详细信息
ISBN:
(纸本)354020721X
We describe WSAT(CC), a local-search solver for computing models of theories in the language of propositional logic extended by cardinality atoms. WSAT(CC) is a processing back-end for the logic PS+, a recently proposed formalism for answer-set programming.
the article provides a uniform representation of abductive reasoning in the logical framework of causal inference relations. the representation covers in a single framework not only traditional, classical forms of abd...
详细信息
the article provides a uniform representation of abductive reasoning in the logical framework of causal inference relations. the representation covers in a single framework not only traditional, classical forms of abduction, but also abductive reasoning in diagnosis, theories of actions and change, and abductive logicprogramming.
An approach where stable models of Disjunctive logic Programs (DLPs) are computed using SMODELS as a core engine is discussed. the approach is based on two program transformations using which the key tasks in computin...
详细信息
ISBN:
(纸本)354020721X
An approach where stable models of Disjunctive logic Programs (DLPs) are computed using SMODELS as a core engine is discussed. the approach is based on two program transformations using which the key tasks in computing disjunctive stable models can be reduced to computing stable models for normal programs. the implementation is based on an architecture where two SMODELS search engines interact. One of the engines is responsible for generating model candidates for a DLP given as input and the other checks for the minimality of the candidates.
the article provides a uniform representation of abductive reasoning in the logical framework of causal inference relations. the representation covers in a single framework not only traditional, classical forms of abd...
详细信息
the article provides a uniform representation of abductive reasoning in the logical framework of causal inference relations. the representation covers in a single framework not only traditional, classical forms of abduction, but also abductive reasoning in diagnosis, theories of actions and change, and abductive logicprogramming.
暂无评论