Sciweavers

3047 search results - page 142 / 610
» On the Meaning of Logical Completeness
Sort
View
IJAR
2007
96views more  IJAR 2007»
14 years 10 months ago
A paraconsistent logic programming approach for querying inconsistent databases
When integrating data coming from multiple different sources we are faced with the possibility of inconsistency in databases. A paraconsistent approach for knowledge base integra...
Sandra de Amo, Mônica Sakuray Pais
CORR
1998
Springer
104views Education» more  CORR 1998»
14 years 9 months ago
Monotonicity and Persistence in Preferential Logics
An important characteristic of many logics for Arti cial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequ...
Joeri Engelfriet
LOGCOM
2010
87views more  LOGCOM 2010»
14 years 8 months ago
Exemplaric Expressivity of Modal Logics
Abstract This paper investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains, and Markov processes, as coalgebras of the powerset, ï...
Bart Jacobs, Ana Sokolova
ICFP
2005
ACM
15 years 10 months ago
Types with semantics: soundness proof assistant
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
Olha Shkaravska
AAAI
1998
14 years 11 months ago
Boosting Combinatorial Search Through Randomization
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
Carla P. Gomes, Bart Selman, Henry A. Kautz