Friday, August 27, 2004
Why Integration as a service?
SourceForge.net: pywin32-bugs
Thursday, August 26, 2004
Probabilistic Algorithmic Knowledge
Probabilistic Algorithmic Knowledge
"Abstract
The framework of algorithmic knowledge assumes that agents use deterministic knowledge algorithms to compute the facts they explicitly know. We extend the framework to allow for randomized knowledge algorithms. We then characterize the information provided by a randomized knowledge algorithm when its answers have some probability of being incorrect. We formalize this information in terms of evidence; a randomized knowledge algorithm returning “Yes” to a query about a fact @ provides evidence for @ being true. Finally, we discuss the extent to which this evidence can be used as a basis for decisions."
"Abstract
The framework of algorithmic knowledge assumes that agents use deterministic knowledge algorithms to compute the facts they explicitly know. We extend the framework to allow for randomized knowledge algorithms. We then characterize the information provided by a randomized knowledge algorithm when its answers have some probability of being incorrect. We formalize this information in terms of evidence; a randomized knowledge algorithm returning “Yes” to a query about a fact @ provides evidence for @ being true. Finally, we discuss the extent to which this evidence can be used as a basis for decisions."
RDF Triples in XML
RAP V0.8.1 - Open Issues
A Foundational Model for Topic Maps
Living with topic maps and RDF
Drools - Home
Drools - Home
"Drools is an augmented implementation of Forgy's Rete algorithm tailored for the Java language. Adapting Rete to an object-oriented interface allows for more natural expression of business rules with regards to business objects.
More importantly, Drools provides for Declarative Programming and is flexible enough to match the semantics of your problem domain. The various parts that compose a rule may be extended to lend domain-specific sense to the rule."
"Drools is an augmented implementation of Forgy's Rete algorithm tailored for the Java language. Adapting Rete to an object-oriented interface allows for more natural expression of business rules with regards to business objects.
More importantly, Drools provides for Declarative Programming and is flexible enough to match the semantics of your problem domain. The various parts that compose a rule may be extended to lend domain-specific sense to the rule."
Deductive Algorithmic Knowledge
Deductive Algorithmic Knowledge is a paper by Riccardo Pucella of Cornell University.
"Abstract
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a particular algorithm, can be used to capture the formal reasoning used by the agents to compute what they explicitly know. We introduce a logic for reasoning about both implicit and explicit knowledge, where the latter is given with respect to a deductive system formalizing a logical theory for agents. The highly structured nature of such logical theories leads to very natural axiomatizations of the resulting logic when interpreted over a fixed deductive system. The decision problem for the logic is NP-complete in general, no harder than propositional logic, and moreover, it remains NP-complete when we fix a tractable deductive system. The logic extends in a straightforward way to multiple agents, where the decision problem becomes PSPACEcomplete."
"Abstract
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a particular algorithm, can be used to capture the formal reasoning used by the agents to compute what they explicitly know. We introduce a logic for reasoning about both implicit and explicit knowledge, where the latter is given with respect to a deductive system formalizing a logical theory for agents. The highly structured nature of such logical theories leads to very natural axiomatizations of the resulting logic when interpreted over a fixed deductive system. The decision problem for the logic is NP-complete in general, no harder than propositional logic, and moreover, it remains NP-complete when we fix a tractable deductive system. The logic extends in a straightforward way to multiple agents, where the decision problem becomes PSPACEcomplete."
Deductive Algorithmic Knowledge
Deductive Algorithmic Knowledge is a (PDF) capture of a set of slides about extending the theory of algorithmic knowledge with deductive computations.
Wednesday, August 25, 2004
BUSINESS RULES COMMUNITY >> The World's Most Trusted Resource For Business Rule Professionals
javarules.org :: The Java Business Rules Community
java.net: Ruling Out: Rule Engines and Declarative Programming Come to Java [Aug. 19, 2004]
Probabilistic Algorithmic Knowledge
Resource-Bounded Reasoning about Knowledge
Monday, August 23, 2004
XML.com: Implementing REST Web Services: Best Practices and Guidelines
W3C Ontaria
SOA/SOI Learning Guide
BPEL Learning Guide
EclipsePythonIntegration - PythonInfo Wiki
EclipsePythonIntegration - PythonInfo Wiki is a page of information about using the Eclipse platform with Python.
Sunday, August 22, 2004
JFIPA: FIPA XML-based Message support for Software Agents
Galaxy Communicator
"Galaxy Communicator is an open source architecture for constructing dialogue systems. Its plug-and-play approach enables developers to combine architecture-compliant commercial software and cutting edge research components. Galaxy Communicator was funded by the Defense Advanced Research Projects Agency (DARPA) of the United States Government. The DARPA Communicator program was designed to support the creation of speech-enabled interfaces that scale gracefully across modalities, from speech-only to interfaces that include graphics, maps, pointing and gesture. Although the DARPA Communicator program has concluded, the open source software and documentation are still available on this website."
Registry
"The Natural Language Software Registry (NLSR) is a concise summary of the capabilities and sources of a large amount of natural language processing (NLP) software available to the NLP community. It comprises academic, commercial and proprietary software with specifications and terms on which it can be acquired clearly indicated."
The OpenNLP Homepage
The OpenNLP Homepage is the home page for a list of open source natural language processing tools.
"OpenNLP is an organizational center for open source projects related to natural language processing. Its primary role is to encourage and facilitate the collaboration of researchers and developers on such projects. Click here to see the current list of OpenNLP projects. We'll also try to keep a fairly up-to-date list of useful links related to NLP software in general."
"OpenNLP is an organizational center for open source projects related to natural language processing. Its primary role is to encourage and facilitate the collaboration of researchers and developers on such projects. Click here to see the current list of OpenNLP projects. We'll also try to keep a fairly up-to-date list of useful links related to NLP software in general."
The OpenNLP Projects Page
Natural Language Toolkit
