Filters








2,885,354 Hits in 5.2 sec

On computing minimal and perfect model membership

C.A. Johnson
1996 Data & Knowledge Engineering  
The computational complexity of a number of problems relating to minimal models of non-Horn deductive databases is considered.  ...  The structure of minimal models is also examined using the notion of a cyclic tree, and methods of determining minimal model membership, minimality of models and compiling the GCWA are presented.  ...  It thus relies upon an ability to compute minimal model membership.  ... 
doi:10.1016/0169-023x(96)00037-7 fatcat:k2gy3qun7naahdev65tlv3nphy

On the computability-theoretic complexity of trivial, strongly minimal models

Bakhadyr M. Khoussainov, Michael C. Laskowski, Steffen Lempp, Reed Solomon
2007 Proceedings of the American Mathematical Society  
We show the existence of a trivial, strongly minimal (and thus uncountably categorical) theory for which the prime model is computable and each of the other countable models computes 0 .  ...  This result shows that the result of Goncharov/Harizanov/Laskowski/Lempp/McCoy [GHLLM03] is best possible for trivial strongly minimal theories in terms of computable model theory.  ...  ON THE COMPLEXITY OF TRIVIAL, STRONGLY MINIMAL MODELS 9 By Lemma 7, T F has a computable prime model. Lemma 15. If A is a nonprime model of T F , then 0 is computable from the atomic diagram of A.  ... 
doi:10.1090/s0002-9939-07-08865-x fatcat:cuml346dkfg37hitqrlohzyx6u

On the Minimality of Stable Models [chapter]

Paolo Ferraris, Vladimir Lifschitz
2011 Lecture Notes in Computer Science  
We are interested in syntactic conditions on a logic program that guarantee the minimality of its stable models.  ...  In the course of research on answer set programming, the concept of a stable model was extended to several new programming constructs, and for some of these extensions the minimality property does not  ...  Acknowledgements We are grateful to Dan Lessin for useful discussions on the topic of this paper, and to Gerhard Brewka for comments on the previous version.  ... 
doi:10.1007/978-3-642-20832-4_5 fatcat:maxrvh4nyjhc5i5qkbicz7iwly

Minimal model generation based on E-hyper tableaux [chapter]

Wenjin Lu
1997 Lecture Notes in Computer Science  
In this paper we develop an approach to generate the minimal models, without explicit minimization process, based on E-hyper tableau which is a variant of hyper tableaux.  ...  But most proposed minimal model generation procedures in the literature are inappropriate in the sense that while generating minimal model, they also generate non-minimal models.  ...  As a result, we do not generate minimal models one by one and no special search order is needed.  ... 
doi:10.1007/3540634932_7 fatcat:opaisq2ng5efzg4dwbn46bnomq

On the Tractability of Minimal Model Computation for Some CNF Theories [article]

Fabrizio Angiulli and Rachel Ben-Eliyahu-Zohary and Fabio Fassetti and Luigi Palopoli
2013 arXiv   pre-print
An algorithmic schema, called the Generalized Elimination Algorithm (GEA) is presented, that computes a minimal model of any positive CNF.  ...  The schema generalizes the Elimination Algorithm (EA) [BP97], which computes a minimal model of positive head-cycle-free (HCF) CNF theories.  ...  The former task consists of computing a minimal model of Π, the latter one is the problem of checking whether a given set of propositional letter is indeed a minimal model for Π.  ... 
arXiv:1310.8120v1 fatcat:edov56zzwbc27l4n6kkqhd75ym

Possibilistic Stratified Minimal Model Semantics

Juan Carlos Nieves, Mauricio Osorio
2009 2009 Mexican International Conference on Computer Science  
In this paper, we introduce a recursive construction of a possibilistic logic programming semantics that we call Possibilistic Stratified Minimal Model Semantics.  ...  One of the main implications of satisfying relevance by this semantics is that it will allow performing top-down queries from a possibilistic knowledge base.  ...  By the moment, we can observe that there are three main factors which can impact in the computational complexity of P MM r 1. the computational cost of computing minimal models, 2. the computational cost  ... 
doi:10.1109/enc.2009.14 dblp:conf/enc/NievesO09 fatcat:atxi2c6m2bbfln256ur2nhn65a

Residual Minimizing Model Interpolation for Parameterized Nonlinear Dynamical Systems

Paul G. Constantine, Qiqi Wang
2012 SIAM Journal on Scientific Computing  
The coefficients of the affine combination are computed with a nonlinear least squares procedure that minimizes the residual of the governing equations.  ...  The approximation properties of this residual minimizing scheme are comparable to existing reduced basis and POD-Galerkin model reduction methods, but its implementation requires only independent evaluations  ...  We also thank Venkatesh Kodur at Michigan State University for providing us with the data to motivate and construct the stochastic model of thermal conductivity.  ... 
doi:10.1137/100816717 fatcat:pdkcup4zezh5xok6dgexlxbpre

Expressing Extension-Based Semantics Based on Stratified Minimal Models [chapter]

Juan Carlos Nieves, Mauricio Osorio, Claudia Zepeda
2009 Lecture Notes in Computer Science  
In particular, we show that one can induce an argumentation semantics (that we call Stratified Argumentation Semantics) based on a logic programming semantics that is based on stratified minimal models  ...  Extension-based argumentation semantics is a successful approach for performing non-monotonic reasoning based on argumentation theory.  ...  in M M r (P ) a stratified minimal model of P .  ... 
doi:10.1007/978-3-642-02261-6_25 fatcat:mqzi2qbzznfubatilgsnhovssu

Minimal solutions for generic imaging models

Srikumar Ramalingam, Peter Sturm
2008 2008 IEEE Conference on Computer Vision and Pattern Recognition  
Using simulations we show that our minimal solutions are more robust to noise compared to non-minimal solutions. We also show very accurate distortion correction results on fisheye images.  ...  A generic imaging model refers to a non-parametric camera model where every camera is treated as a set of unconstrained projection rays.  ...  In our work we propose minimal solutions for the calibration of generic imaging models, which associate one projection ray to each individual pixel.  ... 
doi:10.1109/cvpr.2008.4587710 dblp:conf/cvpr/RamalingamS08 fatcat:omnkan25sremfkuha57cmfkxaq

A minimal model for secure computation (extended abstract)

Uri Feige, Joe Killian, Moni Naor
1994 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94  
We consider a minimal scenario for secure computation: Parties A and B have private inputs x and y and a shared random string r.  ...  Using a computational notion of security, we exhibit efficient protocols for any polynomial-time computable function f , assuming the existence of one-way functions.  ...  In our secure computation model, parties A and B each have the power to compute f , but they need C because neither one of them holds the whole input.  ... 
doi:10.1145/195058.195408 dblp:conf/stoc/FeigeKN94 fatcat:f6dxkrd3njbkpcffcqfud7umem

VecQ: Minimal Loss DNN Model Compression With Vectorized Weight Quantization

Cheng Gong, Yao Chen, Ye Lu, Tao Li, Cong Hao, Deming Chen
2020 IEEE transactions on computers  
Based on this new metric, we develop a new quantization solution called VecQ, which can guarantee minimal direct quantization loss and better model accuracy.  ...  We evaluate our proposed algorithm on MNIST, CIFAR, ImageNet, IMDB movie review and THUCNews text data sets with numerical DNN models.  ...  However, as one of the most critical processes in the model training, the computational overhead of quantization leads to inefficient training of the model.  ... 
doi:10.1109/tc.2020.2995593 fatcat:uaxvmzerkzaezpujs6q2bw2qeu

Correspondence free registration through a point-to-model distance minimization

Mohammad Rouhani, Angel D. Sappa
2011 2011 International Conference on Computer Vision  
Unlike most of the existing works, which are based on minimizing a point-wise correspondence term, we propose to describe the model set by means of an implicit representation.  ...  This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set.  ...  On the contrary to the previous approaches, [24] proposes a fast registration method based on solving an energy minimization problem derived from an implicit polynomial (IP) fitted to the given model  ... 
doi:10.1109/iccv.2011.6126491 dblp:conf/iccv/RouhaniS11 fatcat:3ptey37bdvfxfekcrgtfdeoea4

Heuristic parameter selection based on functional minimization: Optimality and model function approach

Shuai Lu, Peter Mathé
2013 Mathematics of Computation  
These are heuristic rules, free of the noise level, and they are based on minimization of some functional.  ...  We also devise some numerical approach for finding the minimizers, which uses model functions. Numerical experiments indicate that this is an efficient numerical procedure.  ...  of computed errors; • I max , I min ,Ī: maximal, minimal and average number of iterations.  ... 
doi:10.1090/s0025-5718-2013-02674-9 fatcat:ho2wuprvgjdqthnn36l3q7r3iy

Learner modelling by expert teachers: learner information space and the minimal learner model [chapter]

Anne McDougall, Roland Sussex, Geoff Cumming, Samantha Cropp
1995 World Conference on Computers in Education VI  
Giving individualized guidance to a learner must rely on a learner model.  ...  We propose a theoretical framework: the Leamer Information Space and the Minimal Leamer Model.  ...  But if it is indeed an essential feature of the Minimal Leamer Model that it comprises a diversity of types of learner information, the difficulty of building the corresponding computational learner model  ... 
doi:10.1007/978-0-387-34844-5_69 dblp:conf/wcce/McDougallSCC95 fatcat:qejumlwsnfatdj7hoeb2bxtci4

A Quasi-Minimal Model for Paper-Like Surfaces

Mathieu Perriollat, Adrien Bartoli
2007 2007 IEEE Conference on Computer Vision and Pattern Recognition  
They are however difficult to minimally parameterize since the number of meaningful parameters is intrinsically dependent on the actual deformation.  ...  A fully automatic multi-camera threedimensional reconstruction algorithm, including model-based bundleadjustment, demonstrates our model on real images.  ...  The points on the surface are initialized by computing each (x i , y i ) such that their individual reprojection error is minimized, using the initial surface model.  ... 
doi:10.1109/cvpr.2007.383356 dblp:conf/cvpr/PerriollatB07 fatcat:wlm2vknnevdhzk22cprvhhqx7e
« Previous Showing results 1 — 15 out of 2,885,354 results