Sciweavers

1943 search results - page 138 / 389
» Ordering Default Theories
Sort
View
CIMCA
2005
IEEE
16 years 18 days ago
Potentials and Limits of Graph-Algorithms for Discovering Ontology Patterns
The aim of the research presented in this paper is to contribute to reduction of development time for ontologies by discovering reusable parts and patterns. The approach is to use...
Christer Thörn, Orjan Eriksson, Eva Blomqvist...
169
Voted
BIRTHDAY
2005
Springer
16 years 16 days ago
Timing the Untimed: Terminating Successfully While Being Conservative
Abstract. There have been several timed extensions of ACP-style process algebras with successful termination. None of them, to our knowledge, are equationally conservative (ground-...
Jos C. M. Baeten, Mohammad Reza Mousavi, Michel A....
202
Voted
LPAR
2005
Springer
16 years 14 days ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
164
Voted
CT
2001
Springer
15 years 11 months ago
Experimental Politics: Ways of Virtual Worldmaking
We think that Massively Multi-user Online Role-Playing Games (MMORPGs) will soon evolve into Online Societies of political and economic interest. Studying them will require a metho...
Max Borders, Doug Bryan
ENGL
2007
94views more  ENGL 2007»
15 years 7 months ago
Common subproofs in proof pairs
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
Guillermo Morales-Luna