Michael Gelfond

Texas Tech University

Papers

8

Total Citations

256

H-Index

4

About

Michael Gelfond is a pioneering researcher in artificial intelligence, renowned for his foundational and applied work in knowledge representation, reasoning, and logic programming. He is perhaps best known for his contributions to **Answer Set Programming (ASP)**, a powerful declarative programming paradigm that has become a cornerstone of modern AI. His 2016 survey on ASP applications, garnering over 200 citations, highlights how this framework has been adopted across academia and industry to solve complex, real-world problems — from planning and scheduling to natural language processing and bioinformatics. Beyond ASP, Gelfond has made significant strides in **robotics and autonomous systems**, developing architectures that equip robots with sophisticated knowledge representation and reasoning capabilities. His REBA framework exemplifies this work, integrating action languages, probabilistic graphical models, and declarative programming to enable robots to handle uncertainty and operate effectively in dynamic environments. His early work on action languages, dating back to 1999, laid important theoretical groundwork for modeling dynamic domains. Taken together, Gelfond's research bridges theoretical logic and practical AI applications, making him an influential figure for students and researchers working at the intersection of knowledge representation, automated reasoning, and intelligent robotics.

Research Focus

Key Achievements

4
H-Index
8
Papers
256
Total Citations
32
Avg Citations/Paper
🏆 Most Cited Paper
Applications of Answer Set Programming
207 citations · 2016
📈 Most Prolific Year: 2014 (3 Papers)
🤝 Key Collaborators: 6
🏛 Institutions: Texas Tech University

Top Papers

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 14 days ago