11,236 Hits in 7.4 sec

Using resolution for extending KL-ONE-type languages

Tanel Tammet
1995 Proceedings of the fourth international conference on Information and knowledge management - CIKM '95  
Severaf decidable classes usable as new knowledge representation languages are presented, cent aining some well-known ones, like the base language ALC of KL-ONE type systems, along with the resolution-based  ...  The paper presents some methods for developing such languages based on decidable classes.  ...  as inference engines for predicate logic transla- tions of KL-ONE type languages.  ... 
doi:10.1145/221270.221605 dblp:conf/cikm/Tammet95 fatcat:husw4lji4vcolk33rg7pvbojwy

Hybrid Systems for Knowledge Representation in Artificial Intelligence

Rajeswari P.V, Dr. T.
2012 International Journal of Advanced Research in Artificial Intelligence (IJARAI)  
There are few knowledge representation (KR) techniques available for efficiently representing knowledge. However, with the increase in complexity, better methods are needed.  ...  In an effort to construct an intelligent computer system, a primary consideration is to represent large amounts of knowledge in a way that allows effective use and efficiently organizing information to  ...  The difficulties in representing assertional knowledge using KL-ONE gives the idea of the integration of a theoremprover and a KL-ONE-like language into a hybrid system.  ... 
doi:10.14569/ijarai.2012.010806 fatcat:2xstwrasnvazbew6t6w4dtsfze

A resolution-based proof method for temporal logics of knowledge and belief [chapter]

Michael Fisher, Michael Wooldridge, Clare Dixon
1996 Lecture Notes in Computer Science  
Secondly, a family of resolution rules are used, to deal with the interactions between the various operators of the logics.  ...  The logic BLn is somewhat similar: it is a temporal logic that contains connectives for representing the beliefs of agents. The proof methods we present for these logics involve two key steps.  ...  Thus, in extending the temporal resolution method of [7] to BL n and KL n , we need only consider the additional step resolution rules and simplification rules for handling formulae containing modal  ... 
doi:10.1007/3-540-61313-7_72 fatcat:ut6czempxbcntdccrzcbc7dbhq

Simple supervised document geolocation with geodesic grids

Benjamin Wing, Jason Baldridge
2011 Annual Meeting of the Association for Computational Linguistics  
We describe several simple supervised methods for document geolocation using only the document's raw text as evidence.  ...  All of our methods predict locations in the context of geodesic grids of varying degrees of resolution. We evaluate the methods on geotagged Wikipedia articles and Twitter feeds.  ...  This paper benefited from reviewer comments and from discussion in the Natural Language Learning reading group at UT Austin, with particular thanks to Matt Lease.  ... 
dblp:conf/acl/WingB11 fatcat:5r43yuvcyfdkbp5jbp3b7mbboe

Guest editors' foreword

Hans Ulrich Simon, Etsuji Tomita
2007 Theoretical Computer Science  
As for learning from examples, a further decision is whether we impose statistical assumptions on the sequence of examples or not.  ...  The papers in this special issue offer a broad view on the current research in the field including studies on several learning models (such as Bayesian and statistical models, PAC-learning, query-learning  ...  By passing from KL-divergence to the variation distance (still useful for pattern classification tasks), Palmer and Goldberg are able to considerably simplify the proof for PAC-learnability and to remove  ... 
doi:10.1016/j.tcs.2007.07.022 fatcat:komgxsgx7rfp3kgfklnk4zft5u


Ronald J. Brachman, Victoria Pigman Gilbert, Hector J. Levesque
1989 Readings in Artificial Intelligence and Databases  
KRYPTON is unique in that it combines in a completely integrated fashion a frame-based description language and a first-order resolution theorem-prover.  ...  experimental prototype that competently handles both terminological and assertional knowledge; these two kinds of information are tightly linked by having sentences in an assertional component be formed using  ...  On the other hand, KL-TWO uses a much more tractable (propositional) ABox.  ... 
doi:10.1016/b978-0-934613-53-8.50024-8 fatcat:rfp3dractvci3bd26bagw6i2y4

Resolution for temporal logics of knowledge

C Dixon
1998 Journal of Logic and Computation  
A resolution based proof system for a temporal logic of knowledge is presented and shown to be correct. Such logics are useful for proving properties of distributed and multi-agent systems.  ...  An extension of the basic system to the multimodal case is given and illustrated using the 'muddy children problem'.  ...  In this paper, we extend the proof method for purely temporal logics described in [17] to deal with KL n by using modal resolution rules similar to those devised by Mints [29] .  ... 
doi:10.1093/logcom/8.3.345 fatcat:kg6w4aihpfdujjrcpgfnrklyt4

Towards the Integration of Functions, Relations and Types in an AI Programming Language [chapter]

Rolf Backofen, Lutz Euler, Günther Görz
1990 Informatik-Fachberichte  
This language integrates the functional and the logic-oriented programming style and feature types supporting inheritance.  ...  This combination yields a language particularly suited to knowledge representation , especially for application in computational linguistics.  ...  They can be extended up to feature terms without losing the possibility of using unification and a resolution-based theoremprover on them. This is described in full detail in [5] .  ... 
doi:10.1007/978-3-642-76071-6_34 dblp:conf/ki/BackofenEG90 fatcat:hcwebb56hvfjnl6g43kqaz3f6q

Theorem proving for classical logic with partial functions by reduction to Kleene logic

Hans de Nivelle
2014 Journal of Logic and Computation  
For proof search we use a three-valued adaptation of geometric resolution. We prove that the calculus is sound and complete.  ...  In this paper, we develop a theorem proving strategy for Partial Classical Logic (PCL). Proof search takes place in Kleene Logic.  ...  If one would want to express the precondition of (−)in the left column, one would have to extend the language with a formalism for expressing the precondition.  ... 
doi:10.1093/logcom/exu071 fatcat:p4xdf6jgrbbjznm7rpoinbumk4

Linear usage of state

Rasmus Møgelberg, Sam Staton, Bartek Klin
2014 Logical Methods in Computer Science  
We do this by studying a fully-complete state-passing translation from an impure call-by-value language to a new linear type theory: the enriched call-by-value calculus.  ...  The results are not specific to store, but can be applied to any computational effect expressible using algebraic operations, even to effects that are not usually thought of as stateful.  ...  In Section 4 we provide a linear-use state passing translation from the source language to the target language The translation on types takes a type τ of the source language to a value type τ S of the  ... 
doi:10.2168/lmcs-10(1:17)2014 fatcat:byujilghunh2hle6viumuzxzvm

Implementing Influence Analysis Using Parameterised Boolean Equation Systems

María del Mar Gallardo, Christophe Joubert, Pedro Merino
2006 Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006)  
In particular, one powerful method to implement abstract matching is to fill the state vector with a minimal amount of relevant variables for each program point.  ...  The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex data structures.  ...  ANNOTATOR) consists of two parts: a front-end, responsible for encoding the verification of the L 1 µ formula (resp. the static analysis type) on LTS 1 as a BES (resp. PBES) resolution.  ... 
doi:10.1109/isola.2006.26 dblp:conf/isola/GallardoJM06 fatcat:5i77nfnxsjbchhdjqeedn4nuva

Predicting accuracy of extracting information from unstructured text collections

Eugene Agichtein, Silviu Cucerzan
2005 Proceedings of the 14th ACM international conference on Information and knowledge management - CIKM '05  
We present a general language modeling method for quantifying the difficulty of information extraction tasks.  ...  Unfortunately, the success in extracting these relationships can vary for different domains, languages, and document collections.  ...  ACKNOWLEDGEMENTS We thank Luis Gravano for ideas and discussions that inspired this work. We also thank Eric Brill and the anonymous referees for their insightful comments.  ... 
doi:10.1145/1099554.1099678 dblp:conf/cikm/AgichteinC05 fatcat:ibof63i6ovezpnp4n5sqw3joo4

Cooperative and temporally structured information in the visual cortex

Jason M. Samonds, A.B. Bonds
2005 Signal Processing  
When testing small differences (o101) in stimulus orientation with an information-theoretic distance, response discrimination depended on the temporal resolution of response sampling and improved when  ...  Larger orientation differences (4101) are discriminated easily on the basis of the independent spike counts.  ...  Acknowledgements We thank John Allison and Heather Brown for their assistance with the reviewed studies.  ... 
doi:10.1016/j.sigpro.2005.07.006 fatcat:6dhonkqfxrdbxls2ayyr6biblm

Incomplete types for logic databases

Veronica Dahl
1991 Applied Mathematics Letters  
on natural language queries, and to achieve partial execution of some queries.  ...  We propose to extend Horn-clause terms by invisibly associating them with incomplete types, that is, convenient representations of taxonornic information.  ...  Instead, we propose to use typed Horn-clause logic and then compile the taxonomic part of this information into convenient terms, so that we can obtain the same property inheritance in just one resolution  ... 
doi:10.1016/0893-9659(91)90027-s fatcat:7dwgzbtobzfgbooo3hpqes3wbq

Generation High resolution 3D model from natural language by Generative Adversarial Network [article]

Kentaro Fukamizu, Masaaki Kondo, Ryuichi Sakamoto
2019 arXiv   pre-print
To generate high resolution 3D shapes, we use the framework of Conditional Wasserstein GAN.  ...  We present a method of generating high resolution 3D shapes from natural language descriptions.  ...  Recently, artificial intelligence (AI) technology allows us to use these natural languages for operating and controlling the computer systems.  ... 
arXiv:1901.07165v1 fatcat:fz2a5iocpbdbpmd7cibjyrpl2u
« Previous Showing results 1 — 15 out of 11,236 results