Gopal Gupta

Dr. Gopal Gupta


Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2018 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
JAJoaquin Arias
Joaquin Arias
MCManuel Carro
Manuel Carro
ESElmer Salazar
Elmer Salazar
KMKyle Marple
Kyle Marple
GGGopal Gupta
Gopal Gupta
Extending ASP with constraints (CASP) enhances its expressiveness and performance. This extension is not straightforward as the grounding phase, present in most ASP systems, removes variables and the links among them, and also causes a combinatorial explosion in the size of the program. Several methods to overcome this issue have been devised: restricting the constraint domains (e.g., discrete instead of dense), or the type (or number) of models that can be returned. In this paper we propose to incorporate constraints into s(ASP), a goal-directed, top-down execution model which implements ASP while retaining logical variables both during execution and in the answer sets. The resulting model, s(CASP), can constrain variables that, as in CLP, are kept during the execution and in the answer sets. s(CASP) inherits and generalizes the execution model of s(ASP) and is parametric w.r.t. the constraint solver. We describe this novel execution model and show through several examples the enhanced expressiveness of s(CASP) w.r.t. ASP, CLP, and other CASP systems. We also report improved performance w.r.t. other very mature, highly optimized ASP systems in some benchmarks.

1 September 2016 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
ZCZhuo Chen
Zhuo Chen
KMKyle Marple
Kyle Marple
ESElmer Salazar
Elmer Salazar
GGGopal Gupta
Gopal Gupta
LTLakshman Tamil
Lakshman Tamil
Management of chronic diseases such as chronic heart failure (CHF) is a major problem in health care. A standard approach followed by the medical community is to have a committee of experts develop guidelines that all physicians should follow. These guidelines typically consist of a series of complex rules that make recommendations based on a patient's information. Due to their complexity, often the guidelines are ignored or not complied with at all. It is not even clear whether it is humanly possible to follow these guidelines due to their length and complexity. For instance, for CHF, the guidelines run nearly eighty pages. In this paper we describe a physician-advisory system for CHF management that codes the entire set of clinical practice guidelines for CHF using answer set programming (ASP). Our approach is based on developing reasoning templates, that we call knowledge patterns, and using them to systemically code the clinical guidelines for CHF as ASP rules. Use of the knowledge patterns greatly facilitates the development of our system. Given a patient's medical information, our system generates a recommendation for treatment just as a human physician would, using the guidelines. Our system works even in the presence of incomplete information.

12 September 2023 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
ARAbhiramon Rajasekharan
Abhiramon Rajasekharan
YZYankai Zeng
Yankai Zeng
PPParth Padalkar
Parth Padalkar
GGGopal Gupta
Gopal Gupta
Humans understand language by extracting information (meaning) from sentences, combining it with existing commonsense knowledge, and then performing reasoning to draw conclusions. While large language models (LLMs) such as GPT-3 and ChatGPT are able to leverage patterns in the text to solve a variety of NLP tasks, they fall short in problems that require reasoning. They also cannot reliably explain the answers generated for a given question. In order to emulate humans better, we propose STAR, a framework that combines LLMs with Answer Set Programming (ASP). We show how LLMs can be used to effectively extract knowledge-represented as predicates-from language. Goal-directed ASP is then employed to reliably reason over this knowledge. We apply the STAR framework to three different NLU tasks requiring reasoning: qualitative reasoning, mathematical reasoning, and goal-directed conversation. Our experiments reveal that STAR is able to bridge the gap of reasoning in NLU tasks, leading to significant performance improvements, especially for smaller LLMs, i.e., LLMs with a smaller number of parameters. NLU applications developed using the STAR framework are also explainable: along with the predicates generated, a justification in the form of a proof tree can be produced for a given output.

23 August 2017 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
FSFarhad Shakerin
Farhad Shakerin
ESElmer Salazar
Elmer Salazar
GGGopal Gupta
Gopal Gupta
In inductive learning of a broad concept, an algorithm should be able to distinguish concept examples from exceptions and noisy data. An approach through recursively finding patterns in exceptions turns out to correspond to the problem of learning default theories. Default logic is what humans employ in common-sense reasoning. Therefore, learned default theories are better understood by humans. In this paper, we present new algorithms to learn default theories in the form of non-monotonic logic programs. Experiments reported in this paper show that our algorithms are a significant improvement over traditional approaches based on inductive logic programming. Under consideration for acceptance in TPLP.

8 November 2014 in Service Oriented Computing and Applications
Verified
Journal Article
Closed access
PDF file
SBSrividya Bansal
Srividya Bansal
Ajay BansalAjay Bansal
Ajay Bansal
GGGopal Gupta
Gopal Gupta
MBM. Brian Blake
M. Brian Blake

2 November 2021 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
JAJoaquín Arias
Joaquín Arias
MCManuel Carro
Manuel Carro
ZCZhuo Chen
Zhuo Chen
GGGopal Gupta
Gopal Gupta
Automated commonsense reasoning (CR) is essential for building human-like AI systems featuring, for example, explainable AI. Event calculus (EC) is a family of formalisms that model CR with a sound, logical basis. Previous attempts to mechanize reasoning using EC faced difficulties in the treatment of the continuous change in dense domains (e.g. time and other physical quantities), constraints among variables, default negation, and the uniform application of different inference methods, among others. We propose the use of s(CASP), a query-driven, top-down execution model for Predicate Answer Set Programming with Constraints, to model and reason using EC. We show how EC scenarios can be naturally and directly encoded in s(CASP) and how it enables deductive and abductive reasoning tasks in domains featuring constraints involving both dense time and dense fluents.