|
| |
| | [No title] |
 | | Logic is distinguished from other technical sciences, not by the formal definition of the systems that it studies, but rather by the use of logical concepts to evaluate these systems. |  | | Conventional logical notation is also extended to new and analogous concepts, designed to make the similarities and differences between logical relations and computational relations as transparent as possible. |  | | Other relations from logic do {\em not\/} correspond directly to computational relations, but can be understood by their connections to the quaternary form, in which the logic/computation correspondence is direct and transparent. |
|
http://www.people.cs.uchicago.edu/~odonnell/OData/Technical_Papers/Intro_Logic_Prog/intro.tex
(11320 words)
|
|
| |
| | Logic grammars and XML Schema: Table of Contents |
 | | Logic grammars are formal grammars written in logic-programming systems; in the implementation described here, logic grammars capture both the general rules of XML Schema and the specific rules of a particular schema. |  | | Representing schemas as logic grammars offers a better approach: logic grammars can mirror the wording of the XML Schema specification and, at the same time, provide a runnable implementation of it. |  | | The W3C XML Schema specification is dense and sometimes hard to follow; some have suggested it would be better to write specifications in formal, executable languages, so that questions could be answered just by running the spec. |
|
http://www.mulberrytech.com/Extreme/Proceedings/html/2003/Sperberg-McQueen01/EML2003Sperberg-McQueen01-toc.html
(129 words)
|
|
| |
| | Logic grammars and XML Schema |
 | | Model the schema as a logic grammar; use it to parse document instances and generate the post-schema-validation infoset (PSVI). |  | | Move up one level of abstraction: model the schema for schemas as a logic grammar; use it to parse schema documents and generate the appropriate schema components. |  | | The term logic grammar is used to denote grammars written in logic-programming systems; the best known logic grammars are probably DCGs [definite-clause grammars], which are a built-in part of most Prolog systems. |
|
http://www.mulberrytech.com/Extreme/Proceedings/html/2003/Sperberg-McQueen01/EML2003Sperberg-McQueen01.html
(8389 words)
|
|
| |
| | Oracle: Tablespace and Schema |
 | | Schema and Tablespaces are not related.Schema is basically a logical concept which roughly can be said user.Each database can have multiple users as well as schemas.In a schema we have various database objects for that user and not available to other users(schema) unless and until explicit permissions are given. |  | | schema is logic concept, it include all the database objects belongs a user. |  | | Tablespace is a logical entity for keeping the information related to tables, indexes etc.While creating these object you can specify that which tablespace it should go in.Data in the tablespace is stored in physical drive as form of files, called data files.A table space can have multiple data files. |
|
http://www.experts-exchange.com/Databases/Oracle/Q_20519340.html
(520 words)
|
|
| |
| | Chris's Rants: W3C XML Schema Interoperability? |
 | | Some would like a formally defined subset of XML Schema, omitting some of the more advanced features, that would be geared towards consumption by Web services toolkits that generate databinding code in their favorite programming language. |  | | If you don't have that luxury and are doing top-down development of schemas in an open standards development forum such as OASIS, circulate the draft schema amongst the various participants and have them use their favorite development tools to validate the schema and report back any issues. |  | | KISS has never failed me. With that in mind, there are a number of resources available that offer sage advice to schema designers such as this article by Dare Obasanjo which responds to this one by Kohsuke Kawaguchi. |
|
http://webpages.charter.net/chrisfer/2004/04/w3c-xml-schema-interoperability.html
(553 words)
|
|
| |
| | Analyticity and Validity in 1st order Predicate Logic |
 | | You will remember that a tautology is a sentence schema which is true under any consistent interpretation of its sentential letters; no line of its truth table is false, each line sketching a class of interpretations (classified according to the combinations of truth values of the sub-sentences represented by the sentential letters). |  | | Thus, since the first is analytic (it cannot represent a false sentence), the second schema must also be analytic: for if the second were able to represent a false sentence, then since the first schema generates the second, it would be able to do so as well. |  | | Finally, despite the greater complexity of First Level Predicate Logic, we need to be aware that the basic principles of logic underlie it as well as Sentential Logic. |
|
http://www.lawrence.edu/fac/boardmaw/analytic_essay.html
(2017 words)
|
|
| |
| | Re: digital logic |
 | | there are complete computer designs using just logic schema. |  | | so there are certainly differences in that a theoretical gate is instantaneous, also computer buses use tri state logic since either the CPU or memory can set the level depending on whether writing or reading, which apparently introduces some complexity having the lines at *any* voltage when not in use. |  | | :) as the others said digital logic is very neat, and almost contained study very easy to pick up without engineering background, even in computer science courses we assembled circuits. |
|
http://www.usenet.com/newsgroups/sci.logic/msg03407.html
(201 words)
|
|
| |
| | Schema-Based Logic Program Transformation (ResearchIndex) |
 | | Pierre Flener August 1997 In traditional programming methodology, developing a correct and efficient program is divided into two phases: in the first phase, called the synthesis phase, a correct, but maybe inefficient program is constructed, and in the second phase, called the transformation phase, the constructed program is transformed into a more efficient... |  | | 10 Schema-based top-down design of logic programs using abstrac.. |  | | 17 An opportunistic approach for logic program analysis and opt.. |
|
http://citeseer.ist.psu.edu/128198.html
(842 words)
|
|
| |
| | Difference to Inference Article |
 | | I assume that this is because switching repeatedly forces users to learn higher-order logic that are common to the structures of all programs. |  | | In building applications and operating systems, designers and programmers have a plan, a schema, an overall logic of how a program works and of how its various functions relate to each other. |  | | It's not so much the specific menus and keystrokes that have to be relearned, rather it is a deeper level of how we organize our thinking in a way that fits with subtle underlying logic in the structure of the operating system which must be learned. |
|
http://www.psych.utah.edu/malloy/J-ITM_Difference_to_Inference00-09-26/JITM-Diff_to_Inf.htm
(4821 words)
|
|
| |
| | [No title] |
 | | However, it generalizes Church-Henkin-Gallin-style higher order logic, essentially by allowing the type bool to be replaced by an arbitrary boolean algebra, or even a heyting algebra. |  | | The syntax-semantics interface for the time being is left for future study, though we expect the architecture to be consistent with the range of currently available approaches, including the various schemes of semantic underspecification discussed by Richter and Sailer (1999c) and Asudeh's (2001) glue-logical approach. |  | | where pIg is a string of phonological words PIG is a closed term of the syntactic logic pig' is a closed term of the semantic logic Other signs are deduced from the lexical signs by schemata that can be viewed as analogs of either HPSG phrasal schemata or Lambek-style deduction schemata. |
|
http://www.ling.hf.ntnu.no/HPSG2001/papers/pollard.txt
(1142 words)
|
|
| |
| | [Dev] Schema migration roadmap |
 | | Hopefully, none of the schemas ever change and none of this comes into play ;) The community could perhaps help here with migration scripts, if the pre-change and post-change schemas are documented sufficiently. |  | | I don't underestimate the difficulty of the problem, as it includes import systems, export systems, inter-schema encodings, schema migration logic, and sometime intractable migration problems. |  | | Lisa> For 0.6 requirements, so far we've figured that it's Lisa> acceptable for dogfood users to have to export and import Lisa> their data manually in order to upgrade. |
|
http://lists.osafoundation.org/pipermail/dev/2005-May/002858.html
(580 words)
|
|
| |
| | Virtual schema |
 | | He points out that the schema in a directory datastore goes a long way towards setting the context in which you can view the data. |  | | But to move beyond today's directory structures Prompt believes that a key requirement is to have a structure that combines the advantage of directories and databases through an ability not only to virtualize the database objects, but also to virtualize the relationships. |  | | Prompt's insight is that the schema of any datastore creates a context for viewing the information and, as he says, " content without context makes no sense. |
|
http://www.nwfusion.com/newsletters/dir/2002/01418456.html
(663 words)
|
|
| |
| | mental logic chapter |
 | | The next easiest are those that require more than one step, but can be solved using the direct reasoning routine (see Chapter X for the core schemas and the direct reasoning routine). |  | | The other relevant schemas are those that produce conclusions to (1) and (2) above. |  | | Problems that cannot be solved by the direct reasoning routine constitute a third (heterogenous) level of difficulty. |
|
http://www.isc.cnrs.fr/nov/NovPltz.html
(6538 words)
|
|
| |
| | ==> All about Specifications schema |
 | | Specification Schema is referred to as a BPSS instance. |  | | Specification Schema and Business Process Specifications created against it. |  | | business systems may be configured to support execution of business specifications schema. |
|
http://cri.ch/about/specifications_schema.html
(150 words)
|
|
| |
| | Escapable Logic |
 | | The reason the schema is the big deal is that it does for economics what all the Internet's equipment does for electronic transmissions—enforce an agreement on how to play nice with each other. |  | | When people use the Xpertweb tools, they also use the schema's rules, which are based on the standard Xpertweb Mentor Agreement. |  | | Economic Rules For the Best of Us You probably know better than I that a schema is a rule book for XML file structure and XML is a way to organize information so it's readable by machines and people. |
|
http://www.blaserco.com/blogs/2003/03/09.html
(513 words)
|
|
| |
| | Australian Computer Journal - Volume 19 - 1987 |
 | | An approach is detailed for transforming a binary-relationship conceptual schema into a semantically equivalent logic representation. |  | | Keywords and Phrases: conceptual schema, logic programming, fifth generation technology, deductive data base. |  | | The target schema is suitable for direct implementation with logicbased fifth generation technology. |
|
http://www.acs.org.au/journal/acj1987.htm
(2964 words)
|
|
| |
| | SQLWays 3.8 Facilitates Conversion of Server-Side Applications from Informix to All Major Databases |
 | | Conversion of business logic is the most complex part of database migration. |  | | Besides facilitating business logic conversion, SQLWays 3.8 easily migrates Informix data and schema including tables, views, indexes, keys, relationships, constraints, and various other table properties, provides advanced data type mapping and resolves identifier and reserved word conflicts. |  | | The new release of SQLWays is based on Ispirer’s recent achievements in converting database business logic and makes possible the migration of stored procedures and triggers from Informix Dynamic Server to Oracle PL/SQL, Microsoft SQL Server and Sybase Transact-SQL, IBM DB2 and MySQL. |
|
http://www.prweb.com/releases/2005/1/prwebxml197268.php
(745 words)
|
|
| |
| | VLDB 1987: 177-184 |
 | | Finally, it presents Schema Temporal Logic (STL) as a means of retrieving data from multiple historically valid database schemas using temporal logic. |  | | Suryanarayana M. Sripada: A logical framework for temporal deductive databases. |  | | Hervé Gallaire, Jack Minker, Jean-Marie Nicolas: Logic and Databases: A Deductive Approach. |
|
http://www.vldb.org/dblp/db/conf/vldb/MartinNA87.html
(465 words)
|
|
| |
| | Semantic Based Mapping of XML Schema to Relational Schema |
 | | We consider Description Logic, a formalism able to represent both XML Schema and relational schema and the semantic constraints expressible inthe two languages. |  | | First we propose a mapping from XML Schema to Description Logic, then we use Description Logic to analyse and revise the transformation according to the constraints in the original XML Schema. |  | | XML is emerging as the data format, and there are increasing needs to efficiently store and query XML data. |
|
http://www.itee.uq.edu.au/~dke/Research/HProject2003_files/pr-gg-04.html
(308 words)
|
|
| |
| | RE: Fast Schema Updates |
 | | In 9.0 (when schema versioning was added) these provisos were removed. |  | | We will be shortly updating the schema by adding some fields to an already existing table. |  | | The value reported to you by the database will be the initial value defined when you first added the field (as far as I can tell). |
|
http://www.peg.com/lists/peg/history/200012/msg01002.html
(436 words)
|
|
| |
| | PHP and Databases: Table schema/program logic ideas wanted. (recurring dates issue) |
 | | Also note that I ask for "table schema/and program logic". |  | | I'm asking for something like "Try a schema like this one, maybe query using this and that and use PHP to sort these results, etc." |  | | PHP and Databases: Table schema/program logic ideas wanted. |
|
http://www.experts-exchange.com/Web/Web_Languages/PHP/PHP_Databases/Q_21320124.html
(463 words)
|
|
| |
| | Toward a rigorous Interpretation of ESML - Extended Systems Modeling Language. |
 | | Abstract: A graphic-based language known as extended systems modeling language (ESML), which is an extension of the data flow diagram notation for representing control logic in models of real-time systems, is analysed and summarized aiming at a rigorous interpretation of ESML symbols and their combinations. |  | | Translation principles as well as examples of usual transformation and flow patterns are presented both in TS notation and in PN notation. |  | | Based on elementary and compact (''high-level'') Petri nets (PN), to which a succint introduction is given, formal foundations for ESML, in particular for its transformation schema (TS) notation, are proposed. |
|
http://www.informatik.uni-hamburg.de/TGI/pnbib/r/richter_g4.html
(188 words)
|
|
| |
| | XML Schema, Tree Logic and Sheaves Automata |
 | | In this paper, we define a tree logic that directly embeds XML Schema as a plain subset as well as a new class of automata for unranked trees, used to decide this logic, which is well-suited to the processing of XML documents and schemas. |  | | XML documents, and other forms of semi-structured data, may be roughly described as edge labeled trees; it is therefore natural to use tree automata to reason on them. |  | | This idea has already been successfully applied in the context of Document Type Definition (DTD), the simplest standard for defining XML documents validity, but additional work is needed to take into account XML Schema, a more advanced standard, for which regular tree automata are not satisfactory. |
|
http://www.cmi.univ-mrs.fr/~dalzilio/abstract-xmlsheaves.html
(217 words)
|
|
| |
| | Data Logic Flow Schema - KnowledgeStorm UK Results for Data Logic Flow Schema |
 | | January 2005 - (Free Research) A new approach to packaged analytic application is to build packaged reporting elements that are independent of the physical data warehouse schema. |  | | Your search for keyword: Data Logic Flow Schema returned 1310 results. |  | | Data Logic Flow Schema - KnowledgeStorm UK Results for Data Logic Flow Schema |
|
http://knowledgestorm.co.uk/ksuk/search/keyword/Data%20Logic%20Flow%20Schema/Direct%20Related%20Searches/Data%20Logic%20Flow%20Schema
(1445 words)
|
|
| |
| | Transforming Queries from a Relational Schema to an Equivalent Object Schema: A Prototype Based on F-logic |
 | | The problem is to support query transformation transparently, so a user can pose queries locally, without any need of global knowledge about different data models and schema. |  | | This paper describes a technique to support interoperable query processing when multiple heterogeneous knowledge servers are accessed. |  | | Transforming Queries from a Relational Schema to an Equivalent Object Schema: A Prototype Based on F-logic |
|
http://www.cs.uic.edu/~advis/readings/paperhtml/69.html
(102 words)
|
|
| |
| | [No title] |
 | | On separating non stationary from complements of non stationary subsets $A$ of $\lambda$ in various logics moved to 657 |  | | Choiceless poly time logic can answer Hall (+ matching for bipartite graphs when cardinality quantifiers are present) moved to 760 |  | | On Boolean algebras with intermediate number of automorphism moved to 756 |
|
http://shelah.logic.at/listf.html
(2094 words)
|
|
| |
| | Software for building and editing thesauri |
 | | The system allows term definitions to be given in a formal way according to the family of reasoning systems known as "description logics". |  | | The clear, simple interface and comprehensive application logic are designed to make a potentially complex task manageable. |  | | The system implements a multi-editing methodology based on user-experience level and peer-review within terminology teams. |
|
http://www.willpower.demon.co.uk/thessoft.htm
(8497 words)
|
|
| |
| | Knowledge Sharing Foundation |
 | | Logic of schemas and reconciliation of human viewpoint using controlled vocabularies form SchemaLogic |  | | CCM encoding in of ontology as In-memory Referential Information Base (I-RIBs) form OntologyStream Inc |
|
http://www.bcngroup.org/area2/KSF/KSFconference.htm
(173 words)
|
|
| |
| | schema - OneLook Dictionary Search |
 | | Phrases that include schema: database schema, axiom schema of separation, body schema, image schema, xml schema, more... |  | | schema : WordNet 1.7 Vocabulary Helper [home, info] |  | | schema : FOLDOP - Free On Line Dictionary Of Philosophy [home, info] |
|
http://onelook.com/?w=schema&ls=a
(258 words)
|
|
| |
| | Genes Database Schema |
 | | There are a ouple of places in this database schema where data could still be split out into additional tables if necessary. |  | | We also include notes and detail fields for the user to fill in information about what has been researched and what still needs to be examined. |  | | For example, the user's preferences can be stored in a table that contains exactly one record, like in some other database applications. |
|
http://genes.sourceforge.net/dbschema.html
(2979 words)
|
|
| |
| | Chart Logic Software Schema - KnowledgeStorm Content Management Results for Chart Logic Software Schema |
 | | Your search for keyword: Chart Logic Software Schema returned 359 results. |  | | August 2005 - (Free Research) This paper provides an overview of the business-rule-based Versata approach to automating business logic and processes. |  | | Chart Logic Software Schema - KnowledgeStorm Content Management Results for Chart Logic Software Schema |
|
http://whitepaper.intelligententerprise.com/kscontentmgmt/search/keyword/Chart%20Logic%20Software%20Schema/Direct%20Related%20Searches/Chart%20Logic%20Software%20Schema
(1314 words)
|
|
| |
| | Schema : Schema (logic) |
 | | This includes only what is required for some narrow range of actions; e.g., a library card catalogue[?] schema asks librarians only to provide enough information about the book to help library users decide if they want to browse through it, and if so, how to find it. |  | | For example, the axiom schema of replacement is a schema of axioms in axiomatic set theory. |  | | A description of the structure of a database; or: a defined part of a database. |
|
http://www.termsdefined.net/sc/schema-(logic).html
(408 words)
|
|
| |
| | iAnywhere.com - The remote database is not capable of matching the timestamp precision of the consolidated database. ... |
 | | The remote database is not capable of matching the timestamp precision of the consolidated database. |  | | If possible you may lower the timestamp precision on the consolidated database in order to avoid inconsistent timestamp data between the remote and the consolidated database. |  | | Your application, schema, and scripts must contain logic that copes with the precision mismatch |
|
http://www.ianywhere.com/developer/product_manuals/sqlanywhere/0902/en/html/dberen9/00000945.htm
(168 words)
|
|
| |
| | [No title] |
 | | The file url for the schema will appear in the noNamespaceSchemaLocation attribute on the root element of the document (if you haven't created the root element yet, this attribute will appear when you do create it). |  | | Once you have assigned a schema, you can use all of the editing features that require a schema (see next question). |  | | Autocompletion in text view uses the same schema logic to list possible completions. |
|
http://homepage.mac.com/jimbokun/Fantastic.html
(1246 words)
|
|
| |
| | Finite Schematizable Algebraic Logic |
 | | Herein, two finite schema axiomatizable classes of algebras are shown that contain as a reduct the class of representable quasi--polyadic algebras and the class of representable cylindric algebras, respectively. |  | | We present positive results in the direction of finitary algebraization of first order logic without equality as well as that with equality. |  | | Finally, we will indicate how these constructions can be applied to turn negative results (i), (ii) above to positive ones. |
|
http://www.renyi.hu/pub/algebraic-logic/fin-schema.html
(85 words)
|
|
| |
| | CADE13-Workshop: Term Schematizations and Their Applications |
 | | Suggestions or queries concerning the workshop: send an email to schema@logic.at. |  | | FLoC advance program: conference program of CADE, CAV, LICS, and RTA; housing and traveling information. |  | | Persons wishing to give a talk should submit an extended abstract (5-8 pages); all other participants are invited to send a position paper (1-2 pages) stating their interest in the field. |
|
http://www.logic.at/cade13
(437 words)
|
|
| |
| | [No title] |
 | | The schema integration process is investigated in the context of a logic based modelling language. |  | | Two basic forms of integration assertions are identified: object equality assertions and extension relationship assertions.matically integrating schemas, based on a set of integration assertions, is proposed. |  | | It is shown hos equivalent constructs of tual schemas can be represented by certain types of expressition assertions. |
|
http://www.dsv.su.se/~pajo/abstracts/er91.html
(59 words)
|
|
| |
| | Propositional Logic |
 | | However, since we are using the axiomatic method rather than a natural-deduction system, we first present the logic axiomatically and then prove that the introduction and elimination rules used in `natural deduction' systems are valid rules. |  | | The axiomatic development of our sentential logic is presented in the item Logic/Sentential Logic. |  | | Although we have presented the logic axiomatically, our axiom system has the same power as the `natural deduction' systems of sentential logic that you find in any introductory text. |
|
http://mally.stanford.edu/tutorial/sentential.html
(1059 words)
|
|
| |
| | [Phil-logic] Geach Kaplan (Schema N) |
 | | So, one instance of Schema N is #xF(x) = ss0 iff EyEz(-y=z and Fy and Fz and (w)(Fw -> (w=y v w=z))) for any given n, that is. The difficulty (as far as I can see) is that we cannot generalise this statement. |  | | Tom originally posted to FOM, asking for "comments from fom readers about the significance for the foundations of mathematics of allowing non-distributive predication in logic." Here again is the original posting (http://www.cs.nyu.edu/pipermail/fom/2003-July/007068.html) which is a summary of chapter 4 (available on his department's website (http://philosophy.syr.edu/). |  | | Dennis: > I'm still wondering where you [Dean and Tom] are trying to get to. |
|
http://philo.at/pipermail/phil-logic/2004-January/003107.html
(557 words)
|
|
| |
| | Re: Where DAML+OIL deviates from the RDF-Schema spec. from Deborah Mcguinness on 2001-03-03 (www-rdf-logic@w3.org from ... |
 | | I originally proposed that if we wanted > > to use loops to assert equality, we'd lose the ability to (1) > > distinguish intentional from unintentional loops, and (2) force > > developers to understand the logical relationship (which I know from > > experience ain't always easy). |  | | In fact, > > I was reminded later by one of my former postdocs that this situation > > has come up in practice in our experience -- we developed some of our > > KBs for the Parka-DB project using web-scrapers from online > > taxonomies and thesauri. |  | | : jos.deroo.jd@belgium.agfa.com: "Re: Open Worlds, Distribution, Delegation, Federation, Logic" |
|
http://lists.w3.org/Archives/Public/www-rdf-logic/2001Mar/0016.html
(1022 words)
|
|
| |
| | Psychological Model |
 | | " - comment: This is identical to the above 'Schema XZ'. |  | | Schema 'X' : Logic of the Psychological Communication (Palo Alto) |  | | The schema below that I proposed in 1989 (PSO) shows the reasoning which leads to Lacan Model 'L' |
|
http://www.dnafoundation.com/members/akh/psy/modpsy.htm
(1297 words)
|
|
| |
| | Metadata TutorialMetadata Reports |
 | | The following products like Schema Logic Enterprise Suite, Rochade, Metatrieve, Datamapper, Metacenter, Metadata Integration Frame work stores and handles metadata in an efficient and effective manner. |  | | Metadata stored in a repository can be produced in the form of reports for easy understanding and these reports are very useful in explaining about the various objects or data structures and the relationship between these objects. |  | | A metadata report on business process activities, data flow. |
|
http://www.learndatamodeling.com/meta_report.htm
(168 words)
|
|
|