• Aucun résultat trouvé

Automated reasoning

Automated reasoning in metabolic networks with inhibition

Automated reasoning in metabolic networks with inhibition

... Abstract. The use of artificial intelligence to represent and reason about metabolic networks has been widely investigated due to the complexity of their imbrication. Its main goal is to determine the catalytic role of ...

13

Automated reasoning in metabolic networks with inhibition

Automated reasoning in metabolic networks with inhibition

... Abstract. The use of artificial intelligence to represent and reason about metabolic networks has been widely investigated due to the complexity of their imbrication. Its main goal is to determine the catalytic role of ...

12

Automated Reasoning Techniques as Proof-search in Sequent Calculus

Automated Reasoning Techniques as Proof-search in Sequent Calculus

... Chapter 4 Simulating SMT-solving in the sequent calculus An important area of automated reasoning is about satisfiability problems and how to solve them. The most basic satisfiability problem is ...

140

Automated reasoning about classical mechanics

Automated reasoning about classical mechanics

... Given this kind of reasoning scheme, the central element in AMES' simulation procedure is naturally the individual qualitative state analysis: the process by which AMES[r] ...

107

Automated reasoning with function evaluation for COCOLOG

Automated reasoning with function evaluation for COCOLOG

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...

41

Possibilistic reasoning with partially ordered beliefs

Possibilistic reasoning with partially ordered beliefs

... • Possibilistic logic relies on the minimal specificity principle that helps selecting a unique ordering of interpretations, in the spirit of rational closure [32] or system Z of Pearl [36] , while the relative certainty ...

30

Interpolative reasoning with default rules

Interpolative reasoning with default rules

... Default reasoning and interpolation are two impor- tant forms of commonsense rule-based ...preferential reasoning can be further refined by adapting two classical approaches for handling the irrelevance ...

9

Reasoning about Java's reentrant locks

Reasoning about Java's reentrant locks

... Unfortunately, reentrant locks are inherently problematic for separation-logic rea- soning, which tries to completely replace “negative” reasoning about the absence of aliasing by “positive” reasoning about ...

17

Experimenting Analogical Reasoning in Recommendation

Experimenting Analogical Reasoning in Recommendation

... The existence of a unique solution is not always granted: for instance in the Boolean setting, the solution may not exist [ 10 ]. Analogical Inference. In this perspective, analogical reasoning can be viewed as a ...

12

Centralizing equality reasoning in MCSAT

Centralizing equality reasoning in MCSAT

... Egraph operations We now describe the operations that transform the Egraph during the model building phase; they each correspond to an exported primitive in the Egraph API. Any node participating to one of the Egraph ...

13

Relational Reasoning via Probabilistic Coupling

Relational Reasoning via Probabilistic Coupling

... 1 Introduction Probabilistic couplings [ 9 , 7 , 10 ] are a powerful mathematical tool for reasoning about pairs of probabilistic processes: streams of values that evolve randomly according to some rule. While the ...

17

HyLAR: Hybrid Location-Agnostic Reasoning

HyLAR: Hybrid Location-Agnostic Reasoning

... mobile reasoning, ubiquitous semantic web, client-side reasoning 1 Introduction To address scalability concerns that arise with high numbers of simultaneous re- quests, web application designers dispose of ...

8

Automated Program Description

Automated Program Description

... The successive approximation cliche use now also has the approximation role filled, and an explanation of it would now proceed in a slightly different manner. The existenc[r] ...

16

Reasoning under inconsistency: the forgotten connective

Reasoning under inconsistency: the forgotten connective

... 2 to PSPACE) – under the assumption of completeness for PSPACE, of course. 8 Conclusion In this paper, we have given a “logic” for paraconsistent rea- soning where comma is considered as a genuine connective. We have ...

6

Reasoning about actions meets strategic logics

Reasoning about actions meets strategic logics

... 3 Reasoning about Actions We now put ATLEA to work and demonstrate its usefulness in reasoning about mul- tiagent actions. We start by encoding in ATLEA Reiter’s action descriptions in terms of complete ...

15

Reasoning with Multiple-Agent Possibilistic Logic

Reasoning with Multiple-Agent Possibilistic Logic

... bilistic logic. Proc. 13th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR’12), (G. Brewka, Th. Eiter, S. A. McIlraith, eds.), Roma, June 10-14, AAAI Press, 519–529. 6. Cholvy, L. (2011). ...

15

Reasoning about conditions in STIT logic

Reasoning about conditions in STIT logic

... A condition is retroactive when the occurrence of the conditioned legal arrangement (for suspensive conditions) or its cancellation (for resolutive conditions) is assumed to take place a[r] ...

20

Nonmonotonic Reasoning: from Complexity to Algorithms

Nonmonotonic Reasoning: from Complexity to Algorithms

... In this paper, we are concerned with the deductive aspect of reasoning (cf. [4, 31, 9, 1] for works in the same framework). Following Pinkas and Loui's anal- ysis [32], it is convenient to see coherence-based ...

31

Automated Behavioral Fingerprinting

Automated Behavioral Fingerprinting

... 5 Automated protocol clustering Using the previously defined metrics, we derive an unsupervised clustering method that combines two clustering methods in order to determine the number of differ- ent messages ...

21

Program Equivalence by Circular Reasoning

Program Equivalence by Circular Reasoning

... Contributions A language-independent logic and a proof system suitable for stating and proving the equivalence of concrete and of symbolic programs as well as of terminating and non-term[r] ...

37

Show all 954 documents...

Sujets connexes