Results 1  10
of
192
SSemantics Approach: Theory and Applications
, 1994
"... The paper is a general overview of an approach to the semantics of logic programs whose aim is finding notions of models which really capture the operational semantics, and are therefore useful for defining program equivalences and for semanticsbased program analysis. The approach leads to the intr ..."
Abstract

Cited by 124 (27 self)
 Add to MetaCart
The paper is a general overview of an approach to the semantics of logic programs whose aim is finding notions of models which really capture the operational semantics, and are therefore useful for defining program equivalences and for semanticsbased program analysis. The approach leads
Theory of Generalized Annotated Logic Programming and its Applications
 Journal of Logic Programming
, 1992
"... Annotated logics were introduced in [43] and later studied in [5, 7, 31, 32]. In [31], annotations were extended to allow variables and functions, and it was argued that such logics can be used to provide a formal semantics for rulebased expert systems with uncertainty. In this paper we continue to ..."
Abstract

Cited by 211 (26 self)
 Add to MetaCart
to investigate the power of this approach. First, we introduce a new semantics for such programs based on ideals of lattices. Subsequently, some proposals for multivalued logic programming [5, 7, 32, 47, 40, 18] as well as some formalisms for temporal reasoning [1, 3, 42] are shown to fit into this framework
Toward Autonomic Web Services Trust and Selection
, 2004
"... Emerging Web services standards enable the development of largescale applications in open environments. In particular, they enable services to be dynamically bound. However, current techniques fail to address the critical problem of selecting the right service instances. Service selection should be ..."
Abstract

Cited by 107 (3 self)
 Add to MetaCart
applications and services. The agents support considerations of semantics and quality of service (QoS). They interact and share information, in essence creating an ecosystem of collaborative service providers and consumers. Consequently, our approach enables applications to be dynamically configured at runtime
A probabilistic extension to ontology language owl
 In Proceedings of the 37th Hawaii International Conference On System Sciences (HICSS37), Big Island
, 2004
"... With the development of the semantic web activity, ontologies become widely used to represent the conceptualization of a domain. However, none of the existing ontology languages provides a means to capture uncertainty about the concepts, properties and instances in a domain. Probability theory is a ..."
Abstract

Cited by 112 (3 self)
 Add to MetaCart
With the development of the semantic web activity, ontologies become widely used to represent the conceptualization of a domain. However, none of the existing ontology languages provides a means to capture uncertainty about the concepts, properties and instances in a domain. Probability theory is a
Applications of Proof Theory to Isabelle
"... Isabelle [3, 4] is a generic theorem prover. It suppports interactive proof in several formal systems, including firstorder logic (intuitionistic and classical), higherorder logic, MartinLof type theory, and ZermeloFraenkel set theory. New logics can be introduced by specifying their syntax and ..."
Abstract
 Add to MetaCart
and rules of inference. Both natural deduction and sequent calculi are allowed. Isabelle's approach is to represent the various formal systems, or objectlogics, within a single metalogic. The metalogic is a fragment of higherorder logic, formulated in natural deduction. The proof theory of meta
On the Interpretation of Type Theory in Locally Cartesian Closed Categories
 Proceedings of Computer Science Logic, Lecture Notes in Computer Science
, 1994
"... . We show how to construct a model of dependent type theory (category with attributes) from a locally cartesian closed category (lccc). This allows to define a semantic function interpreting the syntax of type theory in an lccc. We sketch an application which gives rise to an interpretation of exten ..."
Abstract

Cited by 57 (1 self)
 Add to MetaCart
to interpret terms associated with substitution like pairing for \Sigma types or application for \Pitypes one needs a semantical equivalent to syntactic substitution. To clarify the issue let us have a look at the "naive" approach described in Seely's seminal paper [14] which contains a subtle
Termination is Languageindependent
 Proceedings of the GULPPRODE'94 Joint Conference on Declarative Programming. Univ. Politecnica de
, 1994
"... We provide a generalized notion of recurrent and acceptable logic programs, which abstracts from the rst order language underlying the program. On this basis, we obtain a proof method for universal termination which is well suited for modular reasoning, and directly reects programming practice. A ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
. Applications of the proposed approach include several natural proof obligations for modular termination proofs, decidability results for the least term model semantics and Ssemantics. Keywords. Termination, recurrent and acceptable programs, rst order theories, least term model semantics, Ssemantics. 1
Formal Ontology Engineering in the DOGMA Approach
, 2002
"... This paper presents a specifically databaseinspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semantics for a real world domain. We address several related key issues, such as knowledge reusability and shareability, sca ..."
Abstract

Cited by 45 (12 self)
 Add to MetaCart
, scalability of the ontology engineering process and methodology, efficient and effective ontology storage and management, and coexistence of heterogeneous rule systems that surround an ontology mediating between it and application agents. Ontologies should represent a domain's semantics independently
Credulous and Sceptical Argument Games for Preferred Semantics
 in Proceedings of JELIAâ€™2000, The 7th European Workshop on Logic for Artificial Intelligence
, 2000
"... . This paper presents dialectical proof theories for Dung's preferred semantics of defeasible argumentation. The proof theories have the form of argument games for testing membership of some (credulous reasoning) or all preferred extensions (sceptical reasoning). The credulous proof theory ..."
Abstract

Cited by 72 (3 self)
 Add to MetaCart
. This paper presents dialectical proof theories for Dung's preferred semantics of defeasible argumentation. The proof theories have the form of argument games for testing membership of some (credulous reasoning) or all preferred extensions (sceptical reasoning). The credulous proof theory
PsychSim: Modeling Theory of Mind with DecisionTheoretic Agents
 in Proceedings of the International Joint Conference on Artificial Intelligence
, 2005
"... Agentbased modeling of human social behavior is an increasingly important research area. A key factor in human social interaction is our beliefs about others, a theory of mind. Whether we believe a message depends not only on its content but also on our model of the communicator. How we act depends ..."
Abstract

Cited by 55 (17 self)
 Add to MetaCart
their own decisiontheoretic model of the world, including beliefs about its environment and recursive models of other agents. Using these quantitative models of uncertainty and preferences, we have translated existing psychological theories into a decisiontheoretic semantics that allow the agents
Results 1  10
of
192