Sciweavers

3082 search results - page 227 / 617
» its 2004
Sort
View
LOPSTR
2004
Springer
15 years 12 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...
LPAR
2004
Springer
15 years 12 months ago
The Inverse Method for the Logic of Bunched Implications
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implicati...
Kevin Donnelly, Tyler Gibson, Neel Krishnaswami, S...
LPAR
2004
Springer
15 years 12 months ago
Abstract DPLL and Abstract DPLL Modulo Theories
DPLL and DPLL Modulo Theories Robert Nieuwenhuis , Albert Oliveras , and Cesare Tinelli We introduce Abstract DPLL, a general and simple abstract rule-based formulation of the Davi...
Robert Nieuwenhuis, Albert Oliveras, Cesare Tinell...
LPNMR
2004
Springer
15 years 12 months ago
Probabilistic Reasoning With Answer Sets
This paper develops a declarative language, P-log, that combines logical and probabilistic arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while c...
Chitta Baral, Michael Gelfond, J. Nelson Rushton
LPNMR
2004
Springer
15 years 12 months ago
Logic Programs With Monotone Cardinality Atoms
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
V. Wiktor Marek, Ilkka Niemelä, Miroslaw Trus...