Michael Gelfond
Michael Gelfond has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Chitta Baral
Arizona State University
3 shared publications - Marcello Balduccini
Department of Computer Science Texas Tech University Lubbock 79409 TX USA
2 shared publications - Nelson Rushton
Department of Computer Science, Texas Tech University Lubbock, TX 79409, USA
2 shared publications - Graciela Gonzalez-Hernandez
Department of Computational Biomedicine, Cedars-Sinai Medical Center, Los Angeles, CA, USA
1 shared publication - Marcello Balduccini
Texas Tech University
1 shared publication - Monica L. Nogueira
The University of North Carolina at Chapel Hill
1 shared publication
Latest Publications
- Top Cited Papers
- 1 January 2009
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 9 (1) , 57-144
Probabilistic reasoning with answer sets
This paper develops a declarative language, P-log, that combines logical and probabilistic arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while causal Bayes nets serve as a probabilistic foundation. We give several non-trivial examples and illustrate the use of P-log for knowledge representation and updating of knowledge. We argue that our approach to updates is more appealing than existing approaches. We give sufficiency conditions for the coherency of P-log programs and show that Bayes nets can be easily mapped to coherent P-log programs.
- 1 January 2009
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 9 (1) , 57-144
Top Cited PapersProbabilistic reasoning with answer sets
This paper develops a declarative language, P-log, that combines logical and probabilistic arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while causal Bayes nets serve as a probabilistic foundation. We give several non-trivial examples and illustrate the use of P-log for knowledge representation and updating of knowledge. We argue that our approach to updates is more appealing than existing approaches. We give sufficiency conditions for the coherency of P-log programs and show that Bayes nets can be easily mapped to coherent P-log programs.
- Open Access
Probabilistic reasoning with answer sets
This paper develops a declarative language, P-log, that combines logical and probabilistic arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while causal Bayes nets serve as a probabilistic foundation. We give several non-trivial examples and illustrate the use of P-log for knowledge representation and updating of knowledge. We argue that our approach to updates is more appealing than existing approaches. We give sufficiency conditions for the coherency of P-log programs and show that Bayes nets can be easily mapped to coherent P-log programs.
Open AccessProbabilistic reasoning with answer sets
This paper develops a declarative language, P-log, that combines logical and probabilistic arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while causal Bayes nets serve as a probabilistic foundation. We give several non-trivial examples and illustrate the use of P-log for knowledge representation and updating of knowledge. We argue that our approach to updates is more appealing than existing approaches. We give sufficiency conditions for the coherency of P-log programs and show that Bayes nets can be easily mapped to coherent P-log programs.
- 1 August 2008
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 53 (1-4) , 251-287
Integrating answer set programming and constraint logic programming
- 1 August 2008
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 53 (1-4) , 251-287
Integrating answer set programming and constraint logic programming
- 13 September 2006
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 47 (1) , 183-219
Answer set based design of knowledge systems
- 13 September 2006
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 47 (1) , 183-219
Answer set based design of knowledge systems
- 1 February 2005
- Published by Springer Nature in Studia Logica
- Vol. 79 (1) , 115-134
Alan: An Action Language For Modelling Non-Markovian Domains
- 1 February 2005
- Published by Springer Nature in Studia Logica
- Vol. 79 (1) , 115-134
Alan: An Action Language For Modelling Non-Markovian Domains
- Open Access
Diagnostic reasoning with A-Prolog
In this paper we suggest an architecture for a software agent which operates a physical device and is capable of making observations and of testing and repairing the device's components. We present simplified definitions of the notions of symptom, candidate diagnosis, and diagnosis which are based on the theory of action language ${\cal AL}$. The definitions allow one to give a simple account of the agent's behavior in which many of the agent's tasks are reduced to computing stable models of logic programs.Open AccessDiagnostic reasoning with A-Prolog
In this paper we suggest an architecture for a software agent which operates a physical device and is capable of making observations and of testing and repairing the device's components. We present simplified definitions of the notions of symptom, candidate diagnosis, and diagnosis which are based on the theory of action language ${\cal AL}$. The definitions allow one to give a simple account of the agent's behavior in which many of the agent's tasks are reduced to computing stable models of logic programs. - 31 July 2003
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 3 (4+5) , 425-461
Diagnostic reasoning with A-Prolog
In this paper, we suggest an architecture for a software agent which operates a physical device and is capable of making observations and of testing and repairing the device's components. We present simplified definitions of the notions of symptom, candidate diagnosis, and diagnosis which are based on the theory of action language . The definitions allow one to give a simple account of the agent's behavior in which many of the agent's tasks are reduced to computing stable models of logic programs.
- 31 July 2003
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 3 (4+5) , 425-461
Diagnostic reasoning with A-Prolog
In this paper, we suggest an architecture for a software agent which operates a physical device and is capable of making observations and of testing and repairing the device's components. We present simplified definitions of the notions of symptom, candidate diagnosis, and diagnosis which are based on the theory of action language . The definitions allow one to give a simple account of the agent's behavior in which many of the agent's tasks are reduced to computing stable models of logic programs.
- 30 June 2002
- Published by Elsevier in Artificial Intelligence
- Vol. 138 (1-2)
Knowledge Representation and Logic Programming
- 30 June 2002
- Published by Elsevier in Artificial Intelligence
- Vol. 138 (1-2)
Knowledge Representation and Logic Programming
- Open Access
- 4 December 2001
- Published by Elsevier in Science of Computer Programming
- Vol. 42 (1) , 87-99
On methodology of representing knowledge in dynamic domains
- 4 December 2001
- Published by Elsevier in Science of Computer Programming
- Vol. 42 (1) , 87-99
Open AccessOn methodology of representing knowledge in dynamic domains