Sciweavers

4617 search results - page 659 / 924
» Automation of Diagrammatic Reasoning
Sort
View
NDJFL
2002
83views more  NDJFL 2002»
15 years 7 months ago
Shortest Axiomatizations of Implicational S4 and S5
Shortest possible axiomatizations for the implicational fragments of the modal logics S4 and S5 are reported. Among these axiomatizations is included a shortest single axiom for im...
Zachary Ernst, Branden Fitelson, Kenneth Harris, L...
CHI
2009
ACM
16 years 8 months ago
Finding canonical behaviors in user protocols
While the collection of behavioral protocols has been common practice in human-computer interaction research for many years, the analysis of large protocol data sets is often extr...
Walter C. Mankowski, Peter Bogunovich, Ali Shokouf...
CSL
2007
Springer
16 years 1 months ago
Incorporating Tables into Proofs
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
Dale Miller, Vivek Nigam
GECCO
2004
Springer
117views Optimization» more  GECCO 2004»
16 years 22 days ago
Evaluating Evolutionary Testability with Software-Measurements
Test case design is the most important test activity with respect to test quality. For this reason, a large number of testing methods have been developed to assist the tester with ...
Frank Lammermann, André Baresel, Joachim We...
KBSE
1997
IEEE
15 years 11 months ago
NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
Johann Schumann, Bernd Fischer 0002