Sciweavers

271 search results - page 19 / 55
» A comparison between two logical formalisms for rewriting
Sort
View
NMR
2004
Springer
14 years 1 months ago
Preferential defeasibility: utility in defeasible logic programming
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...
Fernando A. Tohmé, Guillermo Ricardo Simari
KI
1995
Springer
13 years 11 months ago
What Is a Skeptical Proof?
Abstract. We investigate the task of skeptically reasoning in extensionbased, nonmonotonic logics by concentrating on general argumentation theories. The restricted applicability o...
Michael Thielscher
JACIII
2007
79views more  JACIII 2007»
13 years 7 months ago
State-Transition Computation Models and Program Correctness Thereon
Abstract— A common framework for formalization of statetransition computation models is presented based on a general theory for studying the interrelationships between specifica...
Kiyoshi Akama, Ekawit Nantajeewarawat
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 2 months ago
Psi-calculi: a framework for mobile processes with nominal data and logic
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processe...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...
CSSE
2004
IEEE
13 years 7 months ago
A comparison of modeling strategies in defining XML-based access control languages
One of the most important features of XML-based Web services is that they can be easily accessed over the Internet, but this makes them vulnerable to a series of security threats....
Claudio Agostino Ardagna, Sabrina De Capitani di V...