Sciweavers

376 search results - page 14 / 76
» Agent Logics as Program Logics: Grounding KARO
Sort
View
ICLP
2005
Springer
14 years 1 months ago
Hybrid Probabilistic Logic Programs with Non-monotonic Negation
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this...
Emad Saad, Enrico Pontelli
AAAI
2008
13 years 9 months ago
An Extended Interpreted System Model for Epistemic Logics
The interpreted system model offers a computationally grounded model, in terms of the states of computer processes, to S5 epistemic logics. This paper extends the interpreted syst...
Kaile Su, Abdul Sattar
ICLP
2004
Springer
14 years 26 days ago
Termination of Logic Programs Using Various Dynamic Selection Rules
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
Jan-Georg Smaus
ATAL
2000
Springer
13 years 12 months ago
Agent Programming with Declarative Goals
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
POPL
2008
ACM
14 years 7 months ago
A logical account of pspace
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...