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)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2022.103712

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

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

Through your library

My notes

Similar books and articles

Forgetting auxiliary atoms in forks.Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Pérez & Concepción Vidal - 2019 - Artificial Intelligence 275 (C):575-601.
Temporal equilibrium logic: a survey.Felicidad Aguado, Pedro Cabalar, Martín Diéguez, Gilberto Pérez & Concepción Vidal - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):2-24.
Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
Temporal Equilibrium Logic with past operators.Felicidad Aguado, Pedro Cabalar, Martín Diéguez, Gilberto Pérez & Concepción Vidal - 2017 - Journal of Applied Non-Classical Logics 27 (3-4):161-177.
Harm Reduction: A Misnomer.Nicholas B. King - 2020 - Health Care Analysis 28 (4):324-334.
Le Probleme des Grandes Puissances et Celui des Grandes Racines.Natacha Portier - 2000 - Journal of Symbolic Logic 65 (4):1675-1685.
Le problème Des granDes puissances et celui Des granDes racines.Natacha Portier - 2000 - Journal of Symbolic Logic 65 (4):1675-1685.
Does truth-table of linear norm reduce the one-query tautologies to a random oracle?Masahiro Kumabe, Toshio Suzuki & Takeshi Yamazaki - 2008 - Archive for Mathematical Logic 47 (2):159-180.
Every polynomial-time 1-degree collapses if and only if P = PSPACE.Stephen A. Fenner, Stuart A. Kurtz & James S. Royer - 2004 - Journal of Symbolic Logic 69 (3):713-741.
Reducing dynamic epistemic logic to pdl by program transformation.Jan van Eijck - unknown
On Polynomial-Time Relation Reducibility.Su Gao & Caleb Ziegler - 2017 - Notre Dame Journal of Formal Logic 58 (2):271-285.
The polynomial hierarchy for some structures over the binary words.Herwig Nübling - 2007 - Mathematical Logic Quarterly 53 (1):43-51.
On polynomial time computation over unordered structures.Andreas Blass, Yuri Gurevich & Saharon Shelah - 2002 - Journal of Symbolic Logic 67 (3):1093-1125.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
Some (in)translatability results for normal logic programs and propositional theories.Tomi Janhunen - 2006 - Journal of Applied Non-Classical Logics 16 (1-2):35-86.

Analytics

Added to PP
2022-04-08

Downloads
7 (#1,360,984)

6 months
3 (#1,002,413)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references