AI-Quotient commited on
Commit
4fdc471
·
verified ·
1 Parent(s): 7159e61

Update app.py

Browse files
Files changed (1) hide show
  1. app.py +2 -2
app.py CHANGED
@@ -152,8 +152,8 @@ iface = gr.Interface(
152
  fn=theorem_prover,
153
  inputs=gr.Textbox(label="Enter the theorem you want to prove or disprove"),
154
  outputs=gr.Markdown(label="Agent's response"), # Output as HTML
155
- title="Theorem proving agent",
156
- description="Theorem Proving Agent is an AI-powered system that autonomously selects proof strategies and generates formal proofs for mathematical theorems. As part of AI Quotient’s Millennium Math Challenge, it advances automated reasoning to tackle some of the hardest unsolved problems in mathematics.",
157
  theme = gr.themes.Ocean(),
158
  examples = ["Every prime number greater than 2 is odd.", "The sum of two rational numbers is always rational.", "The power set of any set has strictly greater cardinality than the set itself."]
159
  )
 
152
  fn=theorem_prover,
153
  inputs=gr.Textbox(label="Enter the theorem you want to prove or disprove"),
154
  outputs=gr.Markdown(label="Agent's response"), # Output as HTML
155
+ title="PolyProb",
156
+ description="PolyProb is an advanced AI agent that guides users through the intricate maze of computational complexity. This agent scrutinizes problem descriptions with sophisticated LLM prompts and symbolic reasoning. It classifies problems into categories such as P, NP, NP-complete, NP-hard, or beyond (e.g., PSPACE, EXPTIME), while providing clear, concise explanations of its reasoning. As part of AI Quotient’s Millennium Math Challenge, it is the first step towards solving the P vs NP problem",
157
  theme = gr.themes.Ocean(),
158
  examples = ["Every prime number greater than 2 is odd.", "The sum of two rational numbers is always rational.", "The power set of any set has strictly greater cardinality than the set itself."]
159
  )