Extensions of Answer Set Programming

@inproceedings{Brik2011ExtensionsOA,
  title={Extensions of Answer Set Programming},
  author={Alex Brik},
  booktitle={ICLP},
  year={2011}
}
This paper describes a doctoral research in three areas: Hybrid ASP – an extension of Answer Set Programming for reasoning about dynamical systems, an extension of Set Constraint atoms for reasoning about preferences, computing stable models of logic programs using Metropolis type algorithms. The paper discusses a possible application of all three areas to the problem of maximizing total expected reward. 1998 ACM Subject Classification I.2.3 Deduction and Theorem Proving 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Hybrid ASP. Preprint, technical communications

  • A. Brik, J. B. Remmel
  • ICLP 2011,
  • 2011

Towards Answer Set Programming Based Architectures for Intelligent Agents

  • Sandeep Chintabathina
  • PhD thesis, Texas Tech University,
  • 2010

Local - search techniques in propositional logic extended with cardinality atoms . Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming

  • M. Truszczyński
  • 2007

Similar Papers

Loading similar papers…