Sciweavers

77 search results - page 8 / 16
» Query Answering in Belief Logic Programming
Sort
View
ASC
2006
14 years 11 months ago
A WAM implementation for flexible query answering
In [7] Maria I. Sessa extended the SLD resolution principle with the ability of performing approximate reasoning and flexible query answering. The operational mechanism of similar...
Pascual Julián Iranzo, Clemente Rubio-Manza...
ICLP
2004
Springer
15 years 2 months ago
Speculative Computations in Or-Parallel Tabled Logic Programs
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
LOPSTR
2004
Springer
15 years 2 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...
IJAR
2008
91views more  IJAR 2008»
14 years 9 months ago
Distance-based paraconsistent logics
We introduce a general framework that is based on distance semantics and investigate the main properties of the entailment relations that it induces. It is shown that such entailm...
Ofer Arieli
93
Voted
IJCAI
1989
14 years 10 months ago
Logic Programming with General Clauses and Defaults Based on Model Elimination
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...