On the undecidability of logics with converse, nominals, recursion and counting

&
Artificial Intelligence 158 (1):75-96 (2004)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2004.04.012

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,676

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

Discovery of a Recursive Principle: An Artificial Grammar Investigation of Human Learning of a Counting Recursion Language.Pyeong Whan Cho, Emily Szkudlarek & Whitney Tabor - 2016 - Frontiers in Psychology 7.
Undecidability of subsumption in NIKL.Peter F. Patel-Schneider - 1989 - Artificial Intelligence 39 (2):263-272.
Logics for Artificial Intelligence.Raymond Turner - 1984 - New York, NY, USA: Ellis Horwood.
Complexity, decidability and undecidability results for domain-independent planning.Kutluhan Erol, Dana S. Nau & V. S. Subrahmanian - 1995 - Artificial Intelligence 76 (1-2):75-88.
On the undecidability of probabilistic planning and related stochastic optimization problems.Omid Madani, Steve Hanks & Anne Condon - 2003 - Artificial Intelligence 147 (1-2):5-34.
Definability for model counting.Jean-Marie Lagniez, Emmanuel Lonca & Pierre Marquis - 2020 - Artificial Intelligence 281 (C):103229.
On probabilistic inference by weighted model counting.Mark Chavira & Adnan Darwiche - 2008 - Artificial Intelligence 172 (6-7):772-799.
An efficient algorithm for counting Markov equivalent DAGs.Robert Ganian, Thekla Hamm & Topi Talvitie - 2022 - Artificial Intelligence 304 (C):103648.
aspmc: New frontiers of algebraic answer set counting.Thomas Eiter, Markus Hecher & Rafael Kiesel - 2024 - Artificial Intelligence 330 (C):104109.
Solving Projected Model Counting by Utilizing Treewidth and its Limits.Johannes K. Fichte, Markus Hecher, Michael Morak, Patrick Thier & Stefan Woltran - 2023 - Artificial Intelligence 314 (C):103810.

Analytics

Added to PP
2020-12-22

Downloads
10 (#1,465,793)

6 months
7 (#693,398)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

A decision procedure for alternation-free modal μ-calculi.Yoshinori Tannabe, Koichi Takahashi & Masami Hagiya - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 341-362.

Add more citations

References found in this work

Modal logic with names.George Gargov & Valentin Goranko - 1993 - Journal of Philosophical Logic 22 (6):607 - 636.
The modal logic of inequality.Maarten de Rijke - 1992 - Journal of Symbolic Logic 57 (2):566-584.
Graded modalities. I.M. Fattorosi-Barnaba & F. Caro - 1985 - Studia Logica 44 (2):197 - 221.
Graded Modalities. I.M. Fattorosi-Barnaba & F. De Caro - 1985 - Studia Logica 44 (2):197-221.

View all 6 references / Add more references