Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   propose an extension of Ansr Set Programming (ASP) to deal with (possibly partial) evaluable functions. To this aim,  start from the most general logical counterpart of ASP, Quantified Equilibrium Logic (QEL), and propose a variant QEL=ℱ where the set of functions is partitioned into Herbrand functions (or constructors) and evaluable functions (or operations).  show how this extension has a direct connection to Scott's Logic of Existence, and introduce several useful derived operators, some of them directly borrod from Scott's formalisation. Using this general framework for arbitrary theories,  proceed to focus on a syntactic subclass that corresponds to normal logic programs with evaluable functions and equality.  provide a translation of this class into function-free normal programs and consider a safety condition so that the resulting program is also safe, under the usual meaning in ASP. Finally,  also establish a formal comparison to Lin and Wang's approach (FASP) dealing with evaluable total functions.
['Pedro Cabalar']
I am writing a research paper on a idea Functional answer set programming
[{"from": "human", "value": "I am writing a research paper on a idea Functional answer set programming"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   propose an extension of Ansr Set Programming (ASP) to deal with (possibly partial) evaluable functions. To this aim,  start from the most general logical counterpart of ASP, Quantified Equilibrium Logic (QEL), and propose a variant QEL=\u2131 where the set of functions is partitioned into Herbrand functions (or constructors) and evaluable functions (or operations).  show how this extension has a direct connection to Scott's Logic of Existence, and introduce several useful derived operators, some of them directly borrod from Scott's formalisation. Using this general framework for arbitrary theories,  proceed to focus on a syntactic subclass that corresponds to normal logic programs with evaluable functions and equality.  provide a translation of this class into function-free normal programs and consider a safety condition so that the resulting program is also safe, under the usual meaning in ASP. Finally,  also establish a formal comparison to Lin and Wang's approach (FASP) dealing with evaluable total functions."}]