Scholars Central

CommentaryPublished 31 Jan 2022

Computational intricacy conceptual rationalistic structures through estimate fix point hypothesis

Authors: Lyra Davis

Journal of Pure and Applied Mathematics

Volume 6 · Issue 1 · Pages 7–8

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

Conceptual rationalistic systems (ADFs) have as of late been proposed as adaptable speculation of Dung's theoretical argumentation structures (AFs). In this paper, we present an exhaustive examination of the computational intricacy of ADFs. Our outcomes show that while ADFs are one level up in the polynomial order contrasted with AFs, there is a valuable subclass of ADFs which is all around as mind-boggling as AFs while ostensibly offering additional displaying limits. As a specialized vehicle, we utilize the estimation fixpoint hypothesis of Denecker, Marek and Truszczyński, in this manner showing that it is additionally a helpful instrument for intricacy examination of administrator-based semantics.details summary { cursor: pointer; color: #ffff; } a { font-size: 11px; opacity: 0.5; }ReferencesReal Estate in Thailand Blog | Auto Insurance in New York

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Pure and Applied Mathematics.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Pure and Applied Mathematics
  • SubjectMathematics & Statistics
  • BylineArticles whose byline prints “Lyra Davis”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels