Completeness of Hyper-Resolution via the Semantics of Disjunctive Logic Programs

Information Processing Letters - Netherlands
doi 10.1016/j.ipl.2005.02.003
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Disjunctive Signed Logic Programs

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
1997English

On the Equivalence Between Disjunctive and Abductive Logic Programs

1994English

On the Semantics of Logic Programs With Preferences

Journal of Artificial Intelligence Research
Artificial Intelligence
2007English

Revisiting the Semantics of Interval Probabilistic Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Completeness via Correspondence for Extensions of the Logic of Paradox

Review of Symbolic Logic
MathematicsPhilosophyLogic
2012English

Declarative Semantics for Contradictory Modular Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
1996English

Well-Founded Semantics for Description Logic Programs in the Semantic Web

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy