Sciweavers

1117 search results - page 27 / 224
» Partial Models of Extended Generalized Logic Programs
Sort
View
TABLEAUX
2009
Springer
14 years 3 months ago
Tableaux and Model Checking for Memory Logics
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
Carlos Areces, Diego Figueira, Daniel Gorín...
AMAI
2006
Springer
13 years 8 months ago
A generalization of the Lin-Zhao theorem
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
AAAI
2000
13 years 10 months ago
Decision-Theoretic, High-Level Agent Programming in the Situation Calculus
We propose a frameworkfor robot programming which allows the seamless integration of explicit agent programming with decision-theoretic planning. Specifically, the DTGolog model a...
Craig Boutilier, Raymond Reiter, Mikhail Soutchans...
IWFM
1998
13 years 10 months ago
Strictly Level-Decreasing Logic Programs
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
Anthony Karel Seda, Pascal Hitzler
TLCA
2007
Springer
14 years 2 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva