Sciweavers

191 search results - page 7 / 39
» A Reasoner for Simple Conceptual Logic Programs
Sort
View
ECAI
2004
Springer
14 years 1 months ago
From Knowledge-Based Programs to Graded Belief-Based Programs Part I: On-Line Reasoning
Knowledge-based programs (KBPs) are a powerful notion for expressing action policies in which branching conditions refer to implicit knowledge and call for a deliberation task at e...
Noël Laverny, Jérôme Lang
PLDI
2004
ACM
14 years 1 months ago
KISS: keep it simple and sequential
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
Shaz Qadeer, Dinghao Wu
LOPSTR
2004
Springer
14 years 1 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...
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 2 months ago
From Machine Learning to Machine Reasoning
A plausible definition of "reasoning" could be "algebraically manipulating previously acquired knowledge in order to answer a new question". This definition co...
Léon Bottou
CADE
2003
Springer
14 years 8 months ago
A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular propertie...
Renate A. Schmidt, Ullrich Hustadt