Filters








33,742 Hits in 6.1 sec

Forthcoming papers

1996 Artificial Intelligence  
The definition of MT is part of a larger project which aims at the implementation of self-reflective systems, i.e. systems which are able to introspect their own code, to reason about it and, possibly,  ...  Yip, Model simplification by asymptotic order of magnitude reasoning  ...  While this procedure is known to run in exponential time in the worst case, the proof actually depends on the existence of queries with an exponential number of answers.  ... 
doi:10.1016/s0004-3702(96)90018-1 fatcat:qfrdmco4zbd75cczwybtktfuoa

Probabilistic verification and approximation

Richard Lassaigne, Sylvain Peyronnet
2008 Annals of Pure and Applied Logic  
Models of such systems are labelled discrete time Markov chains and checking specifications consists of computing satisfaction probabilities of linear temporal logic formulas.  ...  We prove that, in general, there is no polynomial time randomized approximation scheme with relative error for probabilistic verification.  ...  Acknowledgements We would like to thank Thomas Hérault for his important participation to the development of APMC, and an anonymous referee for his pertinent remarks and suggestions.  ... 
doi:10.1016/j.apal.2007.11.006 fatcat:kjhhgvh6prglxehlpepy42afju

Probabilistic Verification and Approximation

Richard Lassaigne, Sylvain Peyronnet
2006 Electronical Notes in Theoretical Computer Science  
Models of such systems are labelled discrete time Markov chains and checking specifications consists of computing satisfaction probabilities of linear temporal logic formulas.  ...  We prove that, in general, there is no polynomial time randomized approximation scheme with relative error for probabilistic verification.  ...  Acknowledgements We would like to thank Thomas Hérault for his important participation to the development of APMC, and an anonymous referee for his pertinent remarks and suggestions.  ... 
doi:10.1016/j.entcs.2005.05.031 fatcat:usjmmp4kjzdrnoztoxpskrguka

SLUM: Service Layered Utility Maximization Model to Guide Dynamic Composite Webservice Selection in Virtual Organizations

Abiud Wakhanu Mulongo, Elisha T. Opiyo Omulo, Elisha Abade, William Okello Odongo, Bernard Manderick
2016 Computer Science and Information Technology  
The research objective of the study was to investigate the relative performance of SLUM w.r.t S-MIP and L-MIP using two performance criteria: -solution quality and CPU running time.  ...  A set of numerical and statistical techniques were used to experimentally compare the solution quality and the running time growth of SLUM against L-MIP and S-MIP.  ...  Lastly, the complexity of the problem exponentially expands with an increase in the rule base.  ... 
doi:10.13189/csit.2016.040202 fatcat:6buq7nloqvakvjtzkqs6z6pcvq

The Revival of Structural Subsumption in Tableau-based Reasoners

Ralf Möller, Volker Haarslev, Sebastian Wandelt
2008 International Workshop on Description Logics  
The paper summarizes our experiences with optimization techniques for well-known tableau-based description logic reasoning systems, and analyzes the performance of very simple techniques to cope with Tboxes  ...  whose bulk axioms just use a less expressive language such as ELH, whereas some small parts of the Tbox use a language as expressive as SHIQ.  ...  The description logics EL, ELH, and others Given the definition of ALC in the previous section, we introduce description logic EL by imposing restrictions on the set of possible complex concept descriptions  ... 
dblp:conf/dlog/MollerHW08 fatcat:fixc7ip42jbvrjntntjgg4xzku

Defensive complexity and the phylogenetic conservation of immune control [article]

Erick Chastain, Rustom Antia, Carl T. Bergstrom
2012 arXiv   pre-print
Thus our model of defensive complexity suggests a new hypothesis for the lower rates of evolution for immune control logic compared to other immune structures.  ...  We suggest that this type of defensive complexity on the part of the vertebrate adaptive immune system may be an important element of coevolutionary dynamics between pathogens and their vertebrate hosts  ...  The authors also wish to thank Daril Vilhena, Philip Johnson and Frazer Meacham for helpful comments.  ... 
arXiv:1211.2878v1 fatcat:w2mspxjh3fckbnd7lsfolx5psi

Forthcoming papers

1996 Artificial Intelligence  
While this procedure is known to run in exponential time in the worst case, the proof actually depends on the existence of queries with an exponential number of answers.  ...  This establishes for the first time a strong connection between computing abductive explanations and computing extensions in default logic.  ...  This paper addresses two basic problems associated with composition: how to ensure the interruptibifity of the composed system; and how to allocate computation time optimally among the components.  ... 
doi:10.1016/s0004-3702(96)90008-9 fatcat:za3hntk3f5gyhi6gyfxqvfwcgy

Why Philosophers Should Care About Computational Complexity [article]

Scott Aaronson
2011 arXiv   pre-print
In particular, I argue that computational complexity theory---the field that studies the resources (such as time, space, and randomness) needed to solve computational problems---leads to new perspectives  ...  on the nature of mathematical knowledge, the strong AI debate, computationalism, the problem of logical omniscience, Hume's problem of induction, Goodman's grue riddle, the foundations of quantum mechanics  ...  ; and to David  ... 
arXiv:1108.1791v3 fatcat:eqvibzsxmjczvgmnbtlv5amyxe

Why Philosophers Should Care about Computational Complexity [chapter]

2013 Computability  
the nature of mathematical knowledge, the strong AI debate, computationalism, the problem of logical omniscience, Hume's problem of induction and Goodman's grue riddle, the foundations of quantum mechanics  ...  In particular, I argue that computational complexity theory-the field that studies the resources (such as time, space, and randomness) needed to solve computational problems-leads to new perspectives on  ...  Section 5; and to Andy Drucker, Michael Forbes, Dana Moshkovitz, Ronald de Wolf, and Avi Wigderson for their feedback.  ... 
doi:10.7551/mitpress/8009.003.0011 fatcat:sk6y4k62xbfgdn4nytamdeq6my

Identifying Efficient Abductive Hypotheses Using Multicriteria Dominance Relation

Maciej Komosinski, Adam Kups, Dorota Leszczyńska-Jasion, Mariusz Urbański
2014 ACM Transactions on Computational Logic  
To comprehend the abductive procedure and the evaluation process more extensively, analyses have been conducted on a number of artificially generated abductive problems.  ...  Here, a more advanced system developed to generate and evaluate abductive hypotheses is introduced. Abductive hypotheses have been generated by the implementation of the Synthetic Tableau Method.  ...  The choice of this simple logic allows one to avoid ambiguities pertinent to more complex logical systems and to focus on the problem of abductive reasoning.  ... 
doi:10.1145/2629669 fatcat:it6u6iiqz5ennfwuuicb2tnwha

EXPtime tableaux for ALC

Francesco M. Donini, Fabio Massacci
2000 Artificial Intelligence  
To guarantee the ease of implementation, we also discuss the effects that optimizations (propositional backjumping, simplification, semantic branching, etc.) might have on our complexity result, and introduce  ...  Still, there is a gap between the reasoning services needed by the expressive logics mentioned above and those provided by the current systems.  ...  Fabio Massacci acknowledges the support of the CNR scholarship 201-15-9.  ... 
doi:10.1016/s0004-3702(00)00070-9 fatcat:5bil6begnjerbjh5v6h5amfkq4

Exact Algorithms for NP-Hard Problems: A Survey [chapter]

Gerhard J. Woeginger
2003 Lecture Notes in Computer Science  
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area.  ...  of a graph, and many more.  ...  Furthermore, I thank an unknown referee for many suggestions how to improve the structure, the English, the style, and the contents of this paper.  ... 
doi:10.1007/3-540-36478-1_17 fatcat:5m4p25aq65gpjnbwxsbxgrsnz4

High Efficiency Realization for a Wide-Coverage Unification Grammar [chapter]

John Carroll, Stephan Oepen
2005 Lecture Notes in Computer Science  
Some earlier claims about chart realization are critically reviewed and corrected in the light of a series of practical experiments.  ...  We give a detailed account of an algorithm for efficient tactical generation from underspecified logical-form semantics, using a wide-coverage grammar and a corpus of real-world target utterances.  ...  For efficiency reasons, our algorithm avoids any complex operations on the original logical-form input MRS.  ... 
doi:10.1007/11562214_15 fatcat:mmjofa5hfjcvnpexohsiv5w7x4

On the Hybrid Extension of CTL and CTL + [chapter]

Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick
2009 Lecture Notes in Computer Science  
The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL+ by variables.  ...  The satisfiability problem for H1CTL+ is complete for triply exponential time, this remains true for quite weak fragments and quite strong extensions of the logic.  ...  This is the reason why this paper concentrates on natural extensions of this complexity-wise relatively modest logic.  ... 
doi:10.1007/978-3-642-03816-7_37 fatcat:b6t7er7wzfclxpbyrek5ovkz7a

Associative reinforcement learning: A generate and test algorithm

Leslie Pack Kaelbling
1994 Machine Learning  
An agent that must learn to act in the world by trial and error faces the reinforcement learning problem, which is quite different from standard concept learning.  ...  Although good algorithms exist for this problem in the general case, they are often quite inefficient and do not exhibit generalization.  ...  An anonymous reviewer supplied a number of useful comments and questions.  ... 
doi:10.1007/bf00993348 fatcat:t7hrpohocngzndkl3sdreg5uca
« Previous Showing results 1 — 15 out of 33,742 results