5,268 Hits in 3.0 sec

On Computational Tractability for Rational Verification

Julian Gutierrez, Muhammad Najib, Giuseppe Perelli, Michael Wooldridge
2019 Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence  
Rational verification can be understood as a counterpart of model checking for multiagent systems, but while model checking can be done in polynomial time for some temporal logic specification languages  ...  In particular, we show that for a number of relevant settings, rational verification can be done in polynomial space or even in polynomial time.  ...  Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence  ... 
doi:10.24963/ijcai.2019/47 dblp:conf/ijcai/0001NPW19 fatcat:znxtpd7mqzcjrb6t5sw7abouua

Model Checking Hybrid Systems [chapter]

Edmund M. Clarke, Sicun Gao
2014 Lecture Notes in Computer Science  
We present the framework of delta-complete analysis for bounded reachability problems of hybrid systems.  ...  Our implementation of the techniques scales well on several highly nonlinear hybrid system models that arise in biomedical applications.  ...  We can now develop a new framework for solving bounded reachability problems for hybrid systems based on solving δ-decisions.  ... 
doi:10.1007/978-3-662-45231-8_28 fatcat:4hfxpaeqajfedbz43y2pyujeue

Intractability and the use of heuristics in psychological explanations

Iris van Rooij, Cory D. Wright, Todd Wareham
2010 Synthese  
We then propose computational-level theory revision as a principled and workable alternative.  ...  cognitive scientists, having discovered that some computationallevel characterization f of a cognitive capacity φ is intractable, invoke heuristics as algorithmic-level explanations of how cognizers compute  ...  Verification of tractability, by means of mathematical proof, is indispensable for cognitive scientists that hope to devise tractable computational-level characterizations of cognitive capacities.  ... 
doi:10.1007/s11229-010-9847-7 fatcat:qkekuzyk6bfkpbod5hlztbpkfe

Page 6552 of Mathematical Reviews Vol. , Issue 87k [page]

1987 Mathematical Reviews  
Blum, Lenore (1-CA); Shub, Michael (1-CCNY) Evaluating rational functions: infinite precision is finite cost and tractable on average. SIAM J. Comput. 15 (1986), no. 2, 384-398.  ...  input precision sufficient for z is finite and very “tractable”.  ... 


Ronen Gradwohl, Eran Shmaya
2015 Economics and Philosophy  
We consider several variants of the definition of 'short proof' and several assumptions about the difficulty of computation, and study their different implications on the falsifiability of theories.  ...  We model the concept of a short proof using tools from computational complexity, and provide some examples of economic theories that are falsifiable in the usual sense but not with this additional requirement  ...  See Goldreich (2008) or any other textbook on computational complexity for further details.  ... 
doi:10.1017/s0266267115000127 fatcat:da4ecwnjcvbgpm7c4gdmxaelxm

Front Matter, Table of Contents, Preface, Conference Organization

Maribel Fernández, Anca Muscholl, Michael Wagner
2020 Annual Conference for Computer Science Logic  
One class of structures that have received attention are the ω-categorical structures, which include the rational order and the integers with equality.  ...  The award was officially presented at the conference on the 15th January 2020. The citation of the award, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020).  ... 
doi:10.4230/lipics.csl.2020.0 dblp:conf/csl/X20 fatcat:xrswfikjybh4pjsl7h6fd2vt24

Index to Volumes 37 and 38

2004 Journal of symbolic computation  
Index to Volumes 37 and 38 Volume 37 A long note on Mulders' short product, 391 A parallel multi-modular algorithm for computing Lagrange resolvents, 547 A relative van Hoeij algorithm over number fields  ...  using a rational transform, 377 CLAUSEN, M. and MÜLLER, M., Generating fast Fourier transforms of solvable groups, 137 Computation of the finitistic dimension of monomial algebras, 537 Computing maximal  ...  and an example of degree 8, 1145 Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols, 1375 BÎLȂ, N. and NIESEN, J., On a new procedure for finding nonclassical  ... 
doi:10.1016/s0747-7171(04)00109-9 fatcat:q3cckydpknhjhinygacsvlj52y

Tractable Rational Map Signature [chapter]

Lih-Chung Wang, Yuh-Hua Hu, Feipei Lai, Chun-Yen Chou, Bo-Yin Yang
2005 Lecture Notes in Computer Science  
We present a new multivariate digital signature scheme (TRMS) based on tractable rational maps.  ...  Digital signature schemes are crucial for applications in electronic commerce. The effectiveness and security of a digital signature scheme rely on its underlying public key cryptosystem.  ...  For any point in the image set of S, it is very easy to find point-wise inverse for tractable rational maps: Given a point (y 1 , y 2 , . . . , y n ) ∈ ϕ(S), we can easily compute (x 1 , x 2 , . . . ,  ... 
doi:10.1007/978-3-540-30580-4_17 fatcat:f7g5ycsirrgz5nutr36qmx53em

Rational verification: game-theoretic verification of multi-agent systems

Alessandro Abate, Julian Gutierrez, Lewis Hammond, Paul Harrenstein, Marta Kwiatkowska, Muhammad Najib, Giuseppe Perelli, Thomas Steeples, Michael Wooldridge
2021 Applied intelligence (Boston)  
After motivating and introducing the overall framework of rational verification, we discuss key results obtained in the past few years as well as relevant related work in logic, AI, and computer science  ...  AbstractWe provide a survey of the state of the art of rational verification: the problem of checking whether a given temporal logic formula ϕ is satisfied in some or all game-theoretic equilibria of a  ...  Through our work on rational verification, we also address this gap in the literature of verification for AI systems.  ... 
doi:10.1007/s10489-021-02658-y fatcat:k6revqme4bfhtakfsh4jldm7bq

Holism, or the Erosion of Modularity - a Methodological Challenge for Validation

Johannes Lenhard
2018 Philosophy of Science  
The resulting problem for validating models is one of holism. The argument will proceed by analyzing the techniques of parameterization, tuning, and kludging.  ...  Finally, I will ask in what circumstances this might be sufficient for model validation.  ...  This perspective suggests the computer would enlarge the tractability of complex systems due to its vast capacity for handling (algorithmic) mechanisms.  ... 
doi:10.1086/699675 fatcat:ibsn6uq535eipgw25qs4pzubfy

SVM Speaker Verification using an Incomplete Cholesky Decomposition Sequence Kernel

Jerome Louradour, Khalid Daoudi, Francis Bach
2006 2006 IEEE Odyssey - The Speaker and Language Recognition Workshop  
The Generalized Linear discriminant Sequence (GLDS) kernel has been showing to provide very good performance in SVM speaker verification in NIST SRE evaluations.  ...  We present experiments on the Biosecure project data. The results show that our new sequence kernel outperforms the GLDS one as well as the one developed in our recent work.  ...  An interesting problem then is to find a tractable way to compute or approximate (1) for any p.  ... 
doi:10.1109/odyssey.2006.248129 dblp:conf/odyssey/LouradourDB06 fatcat:6hypn5fixja5fagxoy5narfrfu

Rational Sumchecks [chapter]

Siyao Guo, Pavel Hubáček, Alon Rosen, Margarita Vald
2015 Lecture Notes in Computer Science  
The advantage of rational proofs over their classical counterparts is that they allow for extremely low communication and verification time. In recent work, Guo et al.  ...  We extend the Guo et al. result by constructing a single-round delegation scheme with sublinear verification for all languages in P.  ...  This is done by first transforming the rational interactive proof for NC to RMIP (with only negligible loss in the reward gap) and then applying Theorem 8 on the resulted RMIP.  ... 
doi:10.1007/978-3-662-49099-0_12 fatcat:t3tvm7tumneybjjt5srz2wwoa4

A Non-linear Arithmetic Procedure for Control-Command Software Verification [chapter]

Pierre Roux, Mohamed Iguernlala, Sylvain Conchon
2018 Lecture Notes in Computer Science  
The source code, benchmarks and instructions to replicate the results of Section 5 are available in the figshare repository: The authors thank Rémi Delmas for  ...  The rationale behind this choice is that problems involving only simple rational coefficients can reasonably be expected to admit simple rational solutions 18 .  ...  This makes the SOS relaxation tractable for small values of n and d (n ∼ 10 and d ∼ 3, for instance).  ... 
doi:10.1007/978-3-319-89963-3_8 fatcat:5twek4stxrcsdieqmqq7cpdzne

Logic and Cognition: Special Issue of Best Papers of the ESSLLI 2012 Workshop

Jakub Szymanik, Rineke Verbrugge
2013 Journal of Logic, Language and Information  
(c) computational plausibility, for example, are computations postulated by cognitive models tractable, do they scale-up?  ...  The explanatory power of logic is vast and therefore it has proved a valuable tool for many disciplines, including the building-blocks of cognitive science, such as philosophy, computer science, mathematics  ...  First of all, we thank all speakers at the ESSLLI 2012 workshop on Logic and Cognition for ensuring a diverse and interesting workshop.  ... 
doi:10.1007/s10849-013-9186-4 fatcat:may4rifze5bplokluf4duozyoy

Computer-assisted proofs

2006 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006)  
This paper discusses the problem what makes a computer-assisted proof trustworthy, the quest for an algorithmic support system for computer-assisted proof, relations to global optimization, an analysis  ...  of some recent proofs, and some current challenges which appear to be amenable to a computer-assisted treatment.  ...  The availability of such a verification system would make people elsewhere aware of the possibilities of automatic verification, and would give easy access to powerful techniques which are currently for  ... 
doi:10.1109/scan.2006.11 fatcat:wcecl4cpq5hltfr3vam4rfkrki
« Previous Showing results 1 — 15 out of 5,268 results