Sciweavers

453 search results - page 30 / 91
» FLUX: A Logic Programming Method for Reasoning Agents
Sort
View
LOPSTR
2004
Springer
15 years 11 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
IAT
2007
IEEE
16 years 10 days ago
Training Intelligent Agents in the Semantic Web Era: The Golf Advisor Agent
Agent training techniques study methods to embed empirical, inductive knowledge representations into intelligent agents, in dynamic, recursive or semi-automated ways, expressed in...
Ioannis N. Athanasiadis
IPL
2008
102views more  IPL 2008»
15 years 6 months ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones
LPNMR
2005
Springer
15 years 11 months ago
Approximating Answer Sets of Unitary Lifschitz-Woo Programs
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
Victor W. Marek, Inna Pivkina, Miroslaw Truszczyns...
ICLP
2005
Springer
15 years 11 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