default search action
Annals of Mathematics and Artificial Intelligence, Volume 70
Volume 70, Numbers 1-2, February 2014
- Amedeo Napoli:
Preface to the special issue on "Concept Lattice and their Applications" (CLA-2011). 1-3 - Konstantin Bazhanov, Sergei A. Obiedkov:
Optimizations in computing the Duquenne-Guigues basis of implications. 5-24 - Uwe Ryssel, Felix Distel, Daniel Borchmann:
Fast algorithms for implication bases and attribute exploration using proper premises. 25-53 - Mehdi Kaytoue, Sergei O. Kuznetsov, Juraj Macko, Amedeo Napoli:
Biclustering meets triadic concept analysis. 55-79 - Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin, Alix Boc, Vladimir Makarenkov:
A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes. 81-105 - Pierre Colomb, Alexis Irlande, Olivier Raynaud, Yoan Renaud:
Recursive decomposition tree of a Moore co-family and closure algorithm. 107-122 - Ingrid Falk, Claire Gardent:
Combining formal concept analysis and translation to assign frames and semantic role sets to French verbs. 123-150 - Radim Belohlávek, Dhouha Grissa, Sylvie Guillaume, Engelbert Mephu Nguifo, Jan Outrata:
Boolean factors as a means of clustering of interestingness measures of association rules. 151-184
Volume 70, Number 3, March 2014
- Shai Ben-David, Ruth Urner:
Domain adaptation-can quantity compensate for quality? 185-202 - Jonghoek Kim:
Cooperative exploration and protection of a workspace assisted by information networks. 203-220 - Anastasia Analyti, Carlos Viegas Damásio, Grigoris Antoniou, Ioannis Pachoulakis:
Why-provenance information for RDF, rules, and negation. 221-277 - Rosa Camps, Xavier Mora, Laia Saumell:
Social choice rules driven by propositional logic. 279-312
Volume 70, Number 4, April 2014
- Miroslav N. Velev, John V. Franco:
Application of constraints to formal verification and artificial intelligence. 313-314 - Alex Groce, Klaus Havelund, Gerard J. Holzmann, Rajeev Joshi, Ru-Gang Xu:
Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning. 315-349 - Jan Duracz, Michal Konecný:
Polynomial function intervals for floating-point software verification. 351-398 - Bistra Dilkina, Carla P. Gomes, Ashish Sabharwal:
Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search. 399-431
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.