The proceedings contain 13 papers. The topics discussed include: domain independent integrated multimedia data mining is a frivolous exercise: classicism vs. connectionism debate revisited;knowledgerepresentation and...
The proceedings contain 13 papers. The topics discussed include: domain independent integrated multimedia data mining is a frivolous exercise: classicism vs. connectionism debate revisited;knowledgerepresentation and the embodied mind: towards a philosophy and technology of personalized informatics;semiotics for ontologies and knowledgerepresentation;the philosophy of information a methodological point of view;mapping the multitude. categories in representations;qualities, quantities, and the endurant-perdurant distinction in top-level ontologies;modeling ontology use for information systems;intentional logic and epistemic independency of intelligent database agents;epistemological perspectives on IS-development - a consensus-oriented approach on conceptual modeling;knowledge, action, and context: a process view on knowledge management;and the influence of realist ontology on technological projects: the case of Irish electronic voting.
Understanding classes and methods is a key activity in object-oriented programming, since classes represent the primary abstractions from which applications are built, while methods contain the actual program logic. T...
详细信息
ISBN:
(纸本)0780395409
Understanding classes and methods is a key activity in object-oriented programming, since classes represent the primary abstractions from which applications are built, while methods contain the actual program logic. The main problem of this task is to quickly grasp the purpose and inner structure of a class. To achieve this goal, one must be able to overview multiple methods at once. In this paper we present microprints, pixel-based representations of methods enriched with semantical information. We present three specialized microprints each dealing with a specific aspect we want to understand of methods: (1) state access, (2) control flow, and (3) invocation relationship(1).
The proceedings contain 22 papers. The topics discussed include: a preliminary report on integrating of answer set and constraint solving;extending conceptual logic programs with arbitrary rules;combining answer sets ...
The proceedings contain 22 papers. The topics discussed include: a preliminary report on integrating of answer set and constraint solving;extending conceptual logic programs with arbitrary rules;combining answer sets of nonmonotonic logic programs;an algebraic account of modularity in ID-logic;Nelson's strong negation, safe beliefs and the answer set semantics;disjunctive answer set programming via satisfiability;reducing propositional theories in equilibrium logic to logic programs;towards implementations for advanced equivalence checking in answer-set programming;SELP - a system for studying strong equivalence between logic programs;debugging logic programs under the answer set semantics;an experimental study of search strategies and heuristics in answer set programming;an interactive approach to answer set programming;a backjumping technique for disjunctive logicprogramming;and a language for modular answer set programming: application to ACC tournament scheduling.
knowledgerepresentation has a long tradition in logic and philosophy. Automated reasoning with ontologies and categories had been discussed in philosophy, before it was formalized in artificial intelligence and e.g. ...
详细信息
knowledgerepresentation has a long tradition in logic and philosophy. Automated reasoning with ontologies and categories had been discussed in philosophy, before it was formalized in artificial intelligence and e.g. applied in information systems. But, most of our knowledge is implicit and unconscious, situated and personalized. It is not formally represented, but embodied knowledge, which is learnt by doing, applied by self-organization, and understood by bodily interacting with social environments. In a complex world, we must act and decide with incomplete and fuzzy knowledge under the conditions of bounded rationality. The bounded rationality of embodied minds is a challenge of informatics especially in the complex information world of Internet applications and Web services. It overcomes traditional concepts of mind-body dualism in the philosophy of mind, traditional knowledgerepresentation in AI, and rational agents ("homo oeconomicus") in economics. Personalized informatics opens a trans-disciplinary perspective for philosophy and working technology.
ID-logic uses ideas from the field of logicprogramming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this logic in terms of approximation theory, a...
详细信息
ID-logic uses ideas from the field of logicprogramming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this logic in terms of approximation theory, an algebraic theory which generalizes the semantics of several non-monotonic reasoning formalisms. This allows us to apply certain abstract modularity theorems, developed within the framework of approximation theory, to ID-logic. As such, we are able to offer elegant and simple proofs of generalizations of known theorems, as well as some new results.
This paper describes a system called SELP for studying strong equivalence in answer set logicprogramming. The basic function of the system is to check if two given ground disjunctive logic programs are equivalent, an...
详细信息
This paper describes a system called SELP for studying strong equivalence in answer set logicprogramming. The basic function of the system is to check if two given ground disjunctive logic programs are equivalent, and if not, return a counter-example. This allows us to investigate some interesting properties of strong equivalence, such as a complete characterization for a rule to be strongly equivalent to another one, and checking whether a given set of rules is strongly equivalent to another, perhaps simpler set of rules.
We introduce the temporal logic HAWK and its supporting tool for runtime verification of Java programs. A monitor for a HAWK formula checks if a finite trace of program events satisfies the formula. HAWK is a programm...
详细信息
Using SAT solvers as inference engines in answer set programming systems showed to be a promising approach in building efficient systems. Nowadays SAT based answer set programming systems successfully work with nondis...
详细信息
Using SAT solvers as inference engines in answer set programming systems showed to be a promising approach in building efficient systems. Nowadays SAT based answer set programming systems successfully work with nondis-junctive programs. This paper proposes a way to use SAT solvers for finding answer sets for disjunctive logic programs. We implement two different ways of SAT solver invocation used in nondisjunctive answer set programming. The algorithms are based on the definition of completion for disjunctive programs and the extension of loop formula to the disjunctive case. We propose the necessary modifications to the algorithms known for nondisjunctive programs in order to adapt them to the disjunctive case and demonstrate their implementation based on system CMODELS.
This paper discusses the background, algorithms and implementation techniques to support programmers in 'debugging' logic programs under the answer set semantics. We first investigate what constitutes an error...
详细信息
This paper discusses the background, algorithms and implementation techniques to support programmers in 'debugging' logic programs under the answer set semantics. We first investigate what constitutes an error in such programs and which classes of errors exist. This is used to motivate techniques and algorithms that respectively eliminate certain classes of errors and explain how an error occurred and why it occurred. Finally, details of the IDEAS (Interactive Development and Evaluation tool for Answer Set Semantics) system are given, a prototype version of which implements all of the techniques described.
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that timed languages specified by the past ...
详细信息
ISBN:
(纸本)3540309462
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that timed languages specified by the past fragment of MITL, can be accepted by deterministic timed automata. On the other hand we provide a proof that certain languages expressed in the future fragment Of MITL arc not deterministic,(1) and analyze the reason for this asymmetry.
暂无评论