Sciweavers

3047 search results - page 38 / 610
» On the Meaning of Logical Completeness
Sort
View
DALT
2005
Springer
14 years 2 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
AAAI
2004
13 years 10 months ago
Loop Formulas for Circumscription
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
Joohyung Lee, Fangzhen Lin
ILP
2001
Springer
14 years 28 days ago
Induction of Stable Models
In the line of previous work by S. Muggleton and C. Sakama, we extend the logical characterization of inductive logic programming, to normal logic programs under the stable models ...
Ramón P. Otero
FSS
2010
119views more  FSS 2010»
13 years 7 months ago
Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
Extensions of monoidal t-norm logic MTL and related fuzzy logics with truth stresser modalities such as globalization and “very true” are presented here both algebraically in ...
Agata Ciabattoni, George Metcalfe, Franco Montagna
CADE
2006
Springer
14 years 6 days ago
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
Joe Hendrix, José Meseguer, Hitoshi Ohsaki