Some (in)translatability results for normal logic programs and propositional theories (Q3647255): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3166/jancl.16.35-86 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050842068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation results for defeasible logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the correctness of unfold/fold transformation of normal and extended logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional semantics for disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of the disjunctive stable semantics by partial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional theories are strongly equivalent to logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence and range of applicability of graph-based representations of logic programs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Semantics of Predicate Logic as a Programming Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformations of CLP modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming and knowledge representation---The A-Prolog perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translating default logic into standard autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on translating defaults to circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the intertranslatability of non-monotonic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating the effect of semi-normality on the expressiveness of defaults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly equivalent logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why are there so many loop formulas? / rank
 
Normal rank
Property / cites work
 
Property / cites work: ASSAT: computing answer sets of a logic program by SAT solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A transformation system for deductive database modules with perfect model semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relationship between stable, supported, default and autoepistemic semantics for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programs with stable model semantics as a constraint programming paradigm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation of logic programs: Foundations and techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive powers of the logic programming semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending and implementing the stable model semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong equivalence made easy: nested expressions and weight constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / rank
 
Normal rank

Latest revision as of 05:19, 2 July 2024

scientific article
Language Label Description Also known as
English
Some (in)translatability results for normal logic programs and propositional theories
scientific article

    Statements

    Some (in)translatability results for normal logic programs and propositional theories (English)
    0 references
    0 references
    30 November 2009
    0 references
    modularity
    0 references
    translation functions
    0 references
    expressive power
    0 references
    stable model semantics
    0 references
    answer set programming
    0 references
    satisfiability solvers
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references