A polynomial reduction of forks into logic programs

Artificial Intelligence 308 (C):103712 (2022)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
A selective semantics for logic programs with preferences.Alfredo Gabaldon - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 215--227.
Preferred answer sets for extended logic programs.Gerhard Brewka & Thomas Eiter - 1999 - Artificial Intelligence 109 (1-2):297-356.
A note on the stable model semantics for logic programs.Michael Kaminski - 1997 - Artificial Intelligence 96 (2):467-479.

Analytics

Added to PP
2022-04-08

Downloads
8 (#1,344,496)

6 months
3 (#1,045,901)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations