Sciweavers

1391 search results - page 99 / 279
» Completeness of Neighbourhood Logic
Sort
View
ENTCS
2000
60views more  ENTCS 2000»
13 years 9 months ago
Incompleteness of Behavioral Logics
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
Samuel R. Buss, Grigore Rosu
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
14 years 9 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
WG
2010
Springer
13 years 7 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
WOLLIC
2009
Springer
14 years 3 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
Hugo Herbelin, Gyesik Lee
TABLEAUX
2009
Springer
14 years 3 months ago
Sound Global State Caching for ALC with Inverse Roles
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability with respect to a TBox in the logic ALCI using global state caching. ...
Rajeev Goré, Florian Widmann