Sciweavers

2920 search results - page 323 / 584
» Finite information logic
Sort
View
ACL
1989
15 years 8 months ago
A Three-Valued Interpretation of Negation in Feature Structure Descriptions
Feature structures are informational elements that have been used in several linguistic theories and in computational systems for natural-language processing. A logicaJ calculus h...
Anuj Dawar, K. Vijay-Shanker
ATAL
2010
Springer
15 years 7 months ago
Model checking detectability of attacks in multiagent systems
Information security is vital to many multiagent system applications. In this paper we formalise the notion of detectability of attacks in a MAS setting and analyse its applicabil...
Ioana Boureanu, Mika Cohen, Alessio Lomuscio
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 6 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
ENTCS
2008
103views more  ENTCS 2008»
15 years 6 months ago
Systematic Semantic Tableaux for PLTL
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
JAR
2008
77views more  JAR 2008»
15 years 6 months ago
Translating Higher-Order Clauses to First-Order Clauses
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...
Jia Meng, Lawrence C. Paulson