Filters








699 Hits in 3.9 sec

Realizing Correspondences in Multi-viewpoint Specifications

José Raùl Romero, Juan Ignacio Jaen, Antonio Vallecillo
2009 2009 IEEE International Enterprise Distributed Object Computing Conference  
In particular, we show how correspondences can be modeled both extensionally and intensionally, and propose the use of model transformations to connect these two approaches.  ...  Correspondences specify the relationships between the elements in different views, together with the constraints that guarantee the consistency among these elements.  ...  Modeling correspondences intensionally with QVT. MOF QVT (Query/View/Transformation) [28] is the OMG's standard for specifying MOF model queries, views and transformations.  ... 
doi:10.1109/edoc.2009.23 dblp:conf/edoc/RomeroJV09 fatcat:yp3dvj76mncc7ot2guk7ake5xq

The logiform system

A. Bonsignori, F. Giannotti, L. Lucchesi, F. Turini
1990 Computers and Mathematics with Applications  
Fig • The Inference Engine computes annotations by exploiting the rules in the rule base, i.e. domain-heuristics and primitive predicate definitions.  ...  C = Current intensional representation, i.e. the current set of annotations transformed by multiple Logiform resolution applications.  ... 
doi:10.1016/0898-1221(90)90114-y fatcat:rnpmmwp3ind3vhvht4f4l4b2ci

Handling Negation in General Deductive Databases: A Program Transformation Method

Weiling Li, Komal Khabya, Ming Fang, Rajshekhar Sunderraman
2010 International Conference on Management of Data  
The method introduced in the paper first transforms the given deductive database with arbitrary negation into a "semantically" equivalent deductive database with "limited" negation.  ...  Experimental analysis shows a large speed-up compared to generating the stable models from definition.  ...  Deductive rules with arbitrary negation in their bodies are much more expressive and can represent many views that are not possible with rules without negation or with restricted negation such as stratified  ... 
dblp:conf/comad/LiKFS10 fatcat:mocvayw4wjbpzh7dwfwe6snvfu

Composing transformations for instrumentation and optimization

Michael Gorbovitski, Yanhong A. Liu, Scott D. Stoller, Tom Rothamel
2012 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation - PEPM '12  
For better program improvement, optimization must transform complex queries, in instrumentation in particular and in programs in general, into efficient incremental computations with respect to updates  ...  We specify the transformations declaratively as instrumentation rules and invariant rules, the latter for transforming complex queries in instrumentation and in programs into efficient incremental computations  ...  Our work can be viewed as extensions to existing AOP approaches: our rule language has an explicit definition for preserving invariants, to facilitate formal verification, and it provides powerful static  ... 
doi:10.1145/2103746.2103759 dblp:conf/pepm/GorbovitskiLSR12 fatcat:hj2l7whjfvaxrobgumiakwplse

Equality and fixpoints in the calculus of structures

Kaustuv Chaudhuri, Nicolas Guenot
2014 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14  
We propose in this paper an extension of the calculus of structures, a deep inference formalism, that supports incremental and contextual reasoning with equality and fixpoints in the setting of linear  ...  this paper, we will read inference rules from conclusion to premise(s).  ...  Intensional equality comes fully alive with the addition of least and greatest fixpoints. We show how to adapt the unfolding and coinduction rules of µMALL to an incremental and contextual form.  ... 
doi:10.1145/2603088.2603140 dblp:conf/csl/ChaudhuriG14 fatcat:em5hp7ow3va27a6t2agloy3zeq

Towards a Logic-Based Unifying Framework for Computing [article]

Robert Kowalski, Fariba Sadri
2014 arXiv   pre-print
Computation in the framework is viewed as the task of generating a sequence of state transitions, with the purpose of making an agent's goals all true.  ...  We show that the model generated by destructive updates is identical to the model generated by reasoning with facts containing timestamps.  ...  The logic program L represents the agent's view of the changing state and the state transforming events.  ... 
arXiv:1301.6905v2 fatcat:ff3obn7povf2bn5zkvy4wxzqvm

An extended transformation approach to inductive logic programming

Nada Lavrač, Peter A. Flach
2001 ACM Transactions on Computational Logic  
In a transformation approach, an ILP task is transformed into an equivalent learning task in a different representation formalism.  ...  Inductive logic programming (ILP) is concerned with learning relational descriptions that typically have the form of logic programs.  ...  Flach the hypothesis language consists of definite rules with all variables occurring in the body also occurring in the head (so-called constrained rules), provided these rules are nonrecursive and stratifiable  ... 
doi:10.1145/383779.383781 fatcat:zxmwle4wubaz3jrfamdtyq7jxq

Exploratory computing: a comprehensive approach to data sensemaking

Nicoletta Di Blas, Mirjana Mazuran, Paolo Paolini, Elisa Quintarelli, Letizia Tanca
2016 International Journal of Data Science and Analytics  
EC is not associated with a predefined set of techniques: Rather, it is an approach that can be concretized in different ways.  ...  As introduced in Sect. 2, this is a center-stage notion also in the EC approach and its definition might vary depending on the point of view.  ...  A user may start with some point of view and end up with different ones. Somehow the essence of an exploratory session is discovery: Users change point of view along the way.  ... 
doi:10.1007/s41060-016-0039-5 dblp:journals/ijdsa/BlasMPQT17 fatcat:rubbar6a5zcrxelfjfg653glz4

Interactive foundations of computing

Peter Wegner
1998 Theoretical Computer Science  
Turing machines cannot model interaction machines (which extend Turing machines with interactive input/output) because interaction is not expressible by a finite initial input string.  ...  In contrast, interactive systems model an external reality more demanding and expressive than inner algorithmic transformation rules. 04 (smartness): Extending algorithms with interaction transforms dumb  ...  The tree-structured future is incrementally transformed into a sequential past at each computational step.  ... 
doi:10.1016/s0304-3975(97)00154-0 fatcat:jfv7xn5nlveqjagut2rkidjdem

The communication of inductive inferences [chapter]

Winton Davies, Peter Edwards
1997 Lecture Notes in Computer Science  
If an agent communicates a hypothesis to another agent, and that hypothesis is in conflict with the receiving agent's view of the world, then the receiving agent has to modify or discard the hypothesis  ...  Consider a community of agents where each agent has a limited view of the overall world.  ...  The receiving agent is now able to modify the specific hypothesis if it is inconsistent with its own world view, but can constrain the modifications it makes to be consistent with the set of hypotheses  ... 
doi:10.1007/3-540-62934-3_51 fatcat:tmygsp4v5nakpczwchygd2dlgm

Intensional Datatype Refinement [article]

Eddie Jones, Steven Ramsay
2020 arXiv   pre-print
The pattern-match safety problem is to verify that a given functional program will never crash due to non-exhaustive patterns in its function definitions.  ...  The system extends ML-style type systems with algebraic datatypes by a limited form of structural subtyping and environment-level intersection.  ...  Definition 6 (The Intensional Refinement Environment).  ... 
arXiv:2008.01452v2 fatcat:ganzprvu6be2vo2kiefgpqosvu

From extensional to intensional knowledge: Inductive logic programming techniques and their application to deductive databases [chapter]

Peter A. Flach
1998 Lecture Notes in Computer Science  
Classification-oriented ILP approaches correspond to induction of view definitions (IDB rules), while descriptionoriented ILP approaches correspond to induction of integrity constraints.  ...  Further possible applications are reverse engineering, query optimisation and intensional answers, and data mining.  ...  The system initialises with the most general definition. After seeing the first negative example, this clause is specialised by constraining the second argument.  ... 
doi:10.1007/bfb0055506 fatcat:j7pphmkygncg7nmqoc2tx2coaq

An information integration framework for e-commerce

H. Benetti, D. Beneventano, S. Bergamaschi, F. Guerra, M. Vincini
2002 IEEE Intelligent Systems  
T he Web has transformed electronic information systems from single, isolated nodes into a worldwide network of information exchange and business transactions.  ...  Starting from local source descriptions, the Global Schema Builder generates an integrated view of all data sources and expresses those views using XML.  ...  • In the intensional relationship definition phase, Momis embeds new relationships into the common thesaurus.  ... 
doi:10.1109/5254.988444 fatcat:jpqavoul55gphmcs2qky54y2li

Reactive Computing as Model Generation

Robert Kowalski, Fariba Sadri
2015 New generation computing  
Computation in the framework is viewed as the task of generating a sequence of state transitions, with the purpose of making an agent's goals all true.  ...  We show that the model generated by destructive updates is identical to the model generated by reasoning with facts containing timestamps.  ...  The two main views, to begin with, were the consistency view and the theorem-hood view.  ... 
doi:10.1007/s00354-015-0103-z fatcat:7c3vvdcae5gkrgfepvprs2pezm

Forthcoming papers

1996 Artificial Intelligence  
Abstractions am generated automatically, using an intensional representation of the planning problem (probabilistic STRIPS rules) to determine the most relevant problem features and optimally solving a  ...  We also describe methods by which the abstract solution can be viewed as a set of default reactions that can be improved incrementally, and used as a heuristic for search-based planning or other MDP methods  ...  We also describe methods by which the abstract solution can be viewed as a set of default reactions that can be improved incrementally, and used as a heuristic for search-based planning or other MDP methods  ... 
doi:10.1016/s0004-3702(96)90016-8 fatcat:heev5wzgnbenfpinwk52u2dfzi
« Previous Showing results 1 — 15 out of 699 results