Filters








108,134 Hits in 2.1 sec

Special Issue: Fixpoints in Computer Science 2000

2002 Journal of Logic and Computation  
Along the way of proving these results, we give a concrete description of the free algebras in the corresponding variety of ordered iteration algebras.  ...  We show that there is no finite set of modalities such that the temporal logic over and monadic logic of order have the same expressive power over the natural numbers.  ...  Along the way of proving these results, we give a concrete description of the free algebras in the corresponding variety of ordered iteration algebras.  ... 
doi:10.1093/logcom/12.1.211 fatcat:yowegpu725gxpbpi7eabhc6caa

Logical approaches to imprecise probabilities

Thomas Lukasiewicz
2008 International Journal of Approximate Reasoning  
The paper proposes a probabilistic modal logic in which the probabilities of the possible worlds range over a finite domain of values.  ...  description logics behind OWL Lite and OWL DL.  ...  Last, but not least, I would like to thank the reviewers who contributed with their time to improve the quality of the papers in this special issue. Thomas Lukasiewicz  ... 
doi:10.1016/j.ijar.2007.08.004 fatcat:zlenk5w55fey5juugthfvcq3rm

Turning Web Applications into Web Services by Wrapping Techniques

Giusy Di Lorenzo, Anna Rita Fasolino, Lorenzo Melcarne, Porfirio Tramontana, Valeria Vittorini
2007 Reverse Engineering (WCRE), Working Conference on  
state else decrease the departure time and retry 2 possible solution: 2 possible solution: Put the logic in the automaton Put the logic in the automaton Put the logic in a Workflow Put the logic  ...  basic service Reuses the basic service BS1 BS1 The other activities model The other activities model the business logic of BS2 the business logic of BS2 Realised as BPEL directives Realised  ... 
doi:10.1109/wcre.2007.51 dblp:conf/wcre/LorenzoFMTV07 fatcat:zrdubr7eebe6xghqmb23mmklo4

Logical Implementation of Uncertain Agents [chapter]

Nivea de C. Ferreira, Michael Fisher, Wiebe van der Hoek
2005 Lecture Notes in Computer Science  
We provide a description of the extended logic, the translation procedure for formulae in this extended logic to an executable normal form, and the execution algorithm for such formulae.  ...  In particular, we extend the basis of the METATEM temporal framework with a probabilistic belief dimension captured by the recently introduced PF KD45 logic.  ...  Acknowledgement The first author gratefully acknowledges support by the Brazilian Government under CAPES-scholarship.  ... 
doi:10.1007/11595014_53 fatcat:5cdbeyyyqbeezmev42qjriohmm

INFAMY: An Infinite-State Markov Model Checker [chapter]

Ernst Moritz Hahn, Holger Hermanns, Björn Wachter, Lijun Zhang
2009 Lecture Notes in Computer Science  
INFAMY only explores the model up to a finite depth, with the depth bound being computed on-the-fly.  ...  Conventional model checkers explore the given model exhaustively, which is often costly, due to state explosion, and impossible if the model is infinite.  ...  Besides truncation, INFAMY features SPIN-like [7] state space exploration, and supports models given in a high-level description language.  ... 
doi:10.1007/978-3-642-02658-4_49 fatcat:q5cd25my2vc7djz3nz66c3slsq

Book review: Descriptive complexity, by Neil Immerman

W. Klonowski
2001 Discrete Dynamics in Nature and Society  
The book, and descriptive complexity theory in general, use finite model theory to understand computation.  ...  Inputs, databases, programs, specifications are all finite objects that are modeled as finite logical structures.  ... 
doi:10.1155/s1026022601000061 fatcat:svibibixhjderjixlvkog2zdze

Model-Based Most Specific Concepts in Some Inexpressive Description Logics

Felix Distel
2009 International Workshop on Description Logics  
Model-based most specific concepts are a non-standard reasoning service in Description Logics.  ...  We show that model-msc exist in the logics FL0 and FLE with cyclic TBoxes and for ALC ∪ * with acyclic TBoxes.  ...  Assume that model-msc exist for all models for a given logic. Let C be a concept description in this logic, and C i its extension in the background model i.  ... 
dblp:conf/dlog/Distel09 fatcat:u5fkpl6vf5hjrctergqwngqiu4

An Approach to Exploring Description Logic Knowledge Bases [chapter]

Felix Distel
2010 Lecture Notes in Computer Science  
In the first paper we have shown that in the Description Logics EL and EL gfp , the set of general concept inclusions holding in a finite model always has a finite basis.  ...  In a second part of the paper we examine which description logics can be used for this ABox.  ...  More formally, let i be a finite EL gfp -model and M a finite set of EL gfpconcept descriptions.  ... 
doi:10.1007/978-3-642-11928-6_15 fatcat:kjzytzjvynfwtlxg4xif45xihu

CID - Computing with Infinite Data

Dieter Spreen
2017 Bulletin of the European Association for Theoretical Computer Science  
We will enlist expertise in topology, logic, and set theory, to address the question of which objects are representable and how they can be represented most efficiently.  ...  in this project is different: exact real numbers are taken as first-class citizens and while any computation can only exploit a finite portion of its input in finite time, increased precision is always  ...  differential equations will be explored.  ... 
dblp:journals/eatcs/Spreen17 fatcat:5wake7kvvbhihellbla7hgzvuq

Axiomatisation of general concept inclusions from finite interpretations

D. Borchmann, F. Distel, F. Kriegel
2016 Journal of Applied Non-Classical Logics  
Description logic knowledge bases can be used to represent knowledge about a particular domain in a formal and unambiguous manner.  ...  in the form of vertex and edge labeled graphs.  ...  Franz Baader for helpful discussions during the research on this paper. We also express our thanks to the anonymous reviewers who greatly helped to improve the presentation of our work.  ... 
doi:10.1080/11663081.2016.1168230 fatcat:22qcez3ldndibktp3f2l5bxonu

Towards a Logical Description of Trees in Annotation Graphs

Jens Michaelis, Uwe Mönnich
2007 Journal for Language Technology and Computational Linguistics  
The paper provides a logical specification of trees in annotation graphs commonly used to code documents that are inherently structured on various levels.  ...  The importance of annotation graphs increases rapidly due to new devel opments in multi-media applications, text technology, and semantic web technologies.  ...  Acknowledgements This research was partially supported by grant MO /- of the German Research Foundation (DFG).  ... 
dblp:journals/ldvf/MichaelisM07 fatcat:adiorlnn3jhhpj5eq4qams5som

Page 9 of Language Sciences Vol. , Issue 40 [page]

1976 Language Sciences  
Explores a number of equivalent descriptions of finite state languages. Reprinted in 1965d. April, 1976 1958b Linguistics, Logic, Psychology, and Computers.  ...  The Hague: Mouton. Later incorporated into a more general study of phonological processes in 1968j (SPE). 1956b Three Models for the Description of Language.  ... 

CRYPTOGRAPHIC PROTOCOLS SPECIFICATION AND VERIFICATION TOOLS - A SURVEY

Amol H. Shinde, Umbarkar A.J., Pillai N.R.
2017 ICTACT Journal on Communication Technology  
These tools give feedback to the designers of protocols in terms of loops and attacks in protocols to improve security.  ...  In this paper, we discuss the brief history of formal methods and tools that are useful for the formal verification of the cryptographic protocols.  ...  Brief description of Tools Tool Characteristics Interrogator  Developed in 1983  It is finite state model checker  Implemented in LM-Prolog  It has GUI Inatest  Developed in 1987  Formal  ... 
doi:10.21917/ijct.2017.0226 fatcat:cjtshuv25rbvjggalyzy7xtdkq

Page 8378 of Mathematical Reviews Vol. , Issue 2000m [page]

2000 Mathematical Reviews  
The author axiomatizes this class and shows that the resulting logic lacks the finite model property.  ...  This class is also axiomatized and the resulting logic is shown to have the finite model property. J. M.  ... 

Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis [chapter]

Franz Baader, Ralf Molitor
2000 Lecture Notes in Computer Science  
We propose an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the knowledge base and by a domain expert.  ...  is complete in a certain, well-defined sense.  ...  Definition 8 . 8 Let (T , A) be a consistent DL knowledge base, M a finite set of concept descriptions, and I a model of (T , A).  ... 
doi:10.1007/10722280_20 fatcat:3bhijvqpdbhyzkpcrs5ggfi45u
« Previous Showing results 1 — 15 out of 108,134 results