Sciweavers

27 search results - page 2 / 6
» Cohen-Macaulay Partially Ordered Sets with Pure Resolutions
Sort
View
ICCS
2007
Springer
13 years 12 months ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga
ECAI
2004
Springer
13 years 11 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
CSFW
2005
IEEE
13 years 11 months ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov
CIE
2010
Springer
13 years 7 months ago
The Limits of Tractability in Resolution-Based Propositional Proof Systems
We study classes of propositional contradictions based on the Least Number Principle (LNP) in the refutation system of Resolution and its generalisations with bounded conjunction, ...
Stefan S. Dantchev, Barnaby Martin
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 6 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...