Sciweavers

1321 search results - page 70 / 265
» Subtyping in Logical Form
Sort
View
ASIAN
2007
Springer
157views Algorithms» more  ASIAN 2007»
15 years 6 months ago
A Logical Framework for Evaluating Network Resilience Against Faults and Attacks
Abstract. We present a logic-based framework to evaluate the resilience of computer networks in the face of incidents, i.e., attacks from malicious intruders as well as random faul...
Elie Bursztein, Jean Goubault-Larrecq
GG
2004
Springer
15 years 5 months ago
Representing First-Order Logic Using Graphs
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
Arend Rensink
AGP
2010
IEEE
15 years 5 months ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
Alberto Momigliano, Mario Ornaghi
LORI
2009
Springer
15 years 4 months ago
Epistemic Games in Modal Logic: Joint Actions, Knowledge and Preferences All Together
We present in this work a sound and complete modal logic called EDLA (Epistemic Dynamic Logic of Agency) integrating the concepts of joint action, preference and knowledge and ena...
Emiliano Lorini, François Schwarzentruber, ...
LPNMR
2001
Springer
15 years 4 months ago
A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, no consensus has been reac...
Kewen Wang