Environment Authentication through 3D Structural Analysis
(2004)
Presentation / Conference Contribution
Breckon, T., & Fisher, R. (2004, October). Environment Authentication through 3D Structural Analysis. Presented at Proc. International Conference on Image Analysis and Recognition
Outputs (44)
Generating Regression Tests via Model Checking (2004)
Presentation / Conference Contribution
Xu, L., Dias, M., & Richardson, D. J. (2004, September). Generating Regression Tests via Model Checking. Presented at 28th Annual International Computer Software and Applications Conference, Hong KongDuring software maintenance, regression testing is an expensive but critical activity to ensure that modified versions of the system do not "regress". As software evolves, chances are that not only the implementation changes, but that the specificati... Read More about Generating Regression Tests via Model Checking.
Some notes on interprocedural program slicing (2004)
Presentation / Conference Contribution
Gallagher, K. (2004, September). Some notes on interprocedural program slicing. Presented at 4th IEEE International Workshop on Source Code Analysis and Manipulation : SCAM-4., Chicago, IllinoisWeiser's algorithm for computing interprocedural slices has a serious drawback: it generates spurious criteria which are not feasible in the control flow of the program. When these extraneous criteria are used the slice becomes imprecise in that it h... Read More about Some notes on interprocedural program slicing.
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (2004)
Journal Article
Szeider, S. (2004). Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. Journal of Computer and System Sciences, 69(4), 656-674. https://doi.org/10.1016/j.jcss.2004.04.009Recognition of minimal unsatisfiable CNF formulas (unsatisfiable CNF formulas which become satisfiable if any clause is removed) is a classical DP-complete problem. It was shown recently that minimal unsatisfiable formulas with n variables and n+k cl... Read More about Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable.
Proving BDI properties of agent-oriented programming languages : the asymmetry thesis principles in AgentSpeak(L) (2004)
Journal Article
Bordini, R. H., & Moreira, A. F. (2004). Proving BDI properties of agent-oriented programming languages : the asymmetry thesis principles in AgentSpeak(L). Annals of Mathematics and Artificial Intelligence, 42(1-3), 197-226. https://doi.org/10.1023/b%3Aamai.0000034527.45635.e5In this paper, we consider each of the nine BDI principles defined by Rao and Georgeff based on Bratman's asymmetry thesis, and we verify which ones are satisfied by Rao's AgentSpeak(L), a logic programming language inspired by the BDI architecture f... Read More about Proving BDI properties of agent-oriented programming languages : the asymmetry thesis principles in AgentSpeak(L).
An investigation on using web services for micro-payment (2004)
Presentation / Conference Contribution
Song, W., Chen, D., Chung, J.-Y., & Zhang, L. (2004, September). An investigation on using web services for micro-payment. Presented at European Conference on Web Services, Erfurt, GermanyE-commerce development and applications have been bringing the Internet to business and marketing and reforming our current business styles and processes. As Business to Business (B2B) has been a main stream of the e-commerce activities for a decade,... Read More about An investigation on using web services for micro-payment.
Counting Consistent Phylogenetic Trees is #P-complete (2004)
Journal Article
Bordewich, M., Semple, C., & Talbot, J. (2004). Counting Consistent Phylogenetic Trees is #P-complete. Advances in Mathematics, 33(2), 416-430. https://doi.org/10.1016/j.aam.2003.08.006Reconstructing phylogenetic trees is a fundamental task in evolutionary biology. Various algorithms exist for this purpose, many of which come under the heading of `supertree methods'. These methods amalgamate a collection Ρ of phylogenetic trees int... Read More about Counting Consistent Phylogenetic Trees is #P-complete.
State-space reduction techniques in agent verification (2004)
Presentation / Conference Contribution
Bordini, R. H., Fisher, M., Visser, W., Wooldridge, M., Jennings, N. R., Sierra, C., Sonenberg, L., & Tambe, M. (2004, July). State-space reduction techniques in agent verification. Presented at Third International Joint Conference on Autonomous Agents and Multiagent Systems : AAMAS-2004., New YorkWe have developed a set of tools to allow the use of model-checking techniques for the verification of systems directly implemented in an agent-oriented programming language. The success of model checking as a verification technique for large systems... Read More about State-space reduction techniques in agent verification.
Amalgamations of factorizations of complete equipartite graphs, (2004)
Journal Article
Hilton, A., & Johnson, M. (2004). Amalgamations of factorizations of complete equipartite graphs,. Discrete Mathematics, 284(1-3), 157-175. https://doi.org/10.1016/j.disc.2003.11.030Let t be a positive integer, and let L=(l1,…,lt) and K=(k1,…,kt) be collections of nonnegative integers. A graph has a (t,K,L) factorization if it can be represented as the edge-disjoint union of factors F1,…,Ft where, for 1it, Fi is ki-regular and a... Read More about Amalgamations of factorizations of complete equipartite graphs,.
A maximal tractable class of soft constraints (2004)
Journal Article
Cohen, D., Cooper, M., Jeavons, P., & Krokhin, A. (2004). A maximal tractable class of soft constraints. Journal of Artificial Intelligence Research, 22, 1-22. https://doi.org/10.1613/jair.1400Many researchers in artificial intelligence are beginning to explore the use of soft constraints to express a set of (possibly conflicting) problem requirements. A soft constraint is a function defined on a collection of variables which associates so... Read More about A maximal tractable class of soft constraints.